1 resultado para Box constrained minimization
em Repositorio de la Universidad de Cuenca
Filtro por publicador
- JISC Information Environment Repository (1)
- Aberdeen University (2)
- Academic Archive On-line (Karlstad University; Sweden) (1)
- Academic Research Repository at Institute of Developing Economies (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (5)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (11)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (8)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (9)
- Archive of European Integration (1)
- Aston University Research Archive (20)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (1)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital | Sistema Integrado de Documentación | UNCuyo - UNCUYO. UNIVERSIDAD NACIONAL DE CUYO. (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (11)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (26)
- Bioline International (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (90)
- Brock University, Canada (4)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (7)
- CentAUR: Central Archive University of Reading - UK (56)
- Cochin University of Science & Technology (CUSAT), India (1)
- Collection Of Biostatistics Research Archive (3)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (8)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (30)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (2)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (5)
- Department of Computer Science E-Repository - King's College London, Strand, London (5)
- Digital Commons - Michigan Tech (2)
- Digital Commons at Florida International University (6)
- Digital Peer Publishing (1)
- Digital Repository at Iowa State University (4)
- DigitalCommons@The Texas Medical Center (7)
- DigitalCommons@University of Nebraska - Lincoln (2)
- Digitale Sammlungen - Goethe-Universität Frankfurt am Main (1)
- Diposit Digital de la UB - Universidade de Barcelona (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (10)
- DRUM (Digital Repository at the University of Maryland) (3)
- Duke University (2)
- Gallica, Bibliotheque Numerique - Bibliothèque nationale de France (French National Library) (BnF), France (1)
- Glasgow Theses Service (2)
- Instituto Politécnico de Viseu (3)
- Instituto Politécnico do Porto, Portugal (19)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (7)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (2)
- Martin Luther Universitat Halle Wittenberg, Germany (4)
- Massachusetts Institute of Technology (1)
- Memorial University Research Repository (1)
- Ministerio de Cultura, Spain (14)
- National Center for Biotechnology Information - NCBI (51)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- Publishing Network for Geoscientific & Environmental Data (118)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (3)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (1)
- Repositório Científico da Universidade de Évora - Portugal (2)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (9)
- Repositório da Produção Científica e Intelectual da Unicamp (13)
- Repositorio de la Universidad de Cuenca (1)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (49)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (9)
- School of Medicine, Washington University, United States (1)
- Scielo Saúde Pública - SP (7)
- Scottish Institute for Research in Economics (SIRE) (SIRE), United Kingdom (1)
- Universidad de Alicante (7)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (16)
- Universidade Complutense de Madrid (1)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade do Minho (5)
- Universidade Estadual Paulista "Júlio de Mesquita Filho" (UNESP) (1)
- Universidade Federal do Pará (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (3)
- Universitat de Girona, Spain (1)
- Université de Lausanne, Switzerland (37)
- Université de Montréal (1)
- Université de Montréal, Canada (11)
- University of Canberra Research Repository - Australia (2)
- University of Connecticut - USA (8)
- University of Michigan (97)
- University of Queensland eSpace - Australia (48)
- University of Southampton, United Kingdom (3)
- University of Washington (1)
- WestminsterResearch - UK (1)
Resumo:
Policy and decision makers dealing with environmental conservation and land use planning often require identifying potential sites for contributing to minimize sediment flow reaching riverbeds. This is the case of reforestation initiatives, which can have sediment flow minimization among their objectives. This paper proposes an Integer Programming (IP) formulation and a Heuristic solution method for selecting a predefined number of locations to be reforested in order to minimize sediment load at a given outlet in a watershed. Although the core structure of both methods can be applied for different sorts of flow, the formulations are targeted to minimization of sediment delivery. The proposed approaches make use of a Single Flow Direction (SFD) raster map covering the watershed in order to construct a tree structure so that the outlet cell corresponds to the root node in the tree. The results obtained with both approaches are in agreement with expert assessments of erosion levels, slopes and distances to the riverbeds, which in turn allows concluding that this approach is suitable for minimizing sediment flow. Since the results obtained with the IP formulation are the same as the ones obtained with the Heuristic approach, an optimality proof is included in the present work. Taking into consideration that the heuristic requires much less computation time, this solution method is more suitable to be applied in large sized problems.