1 resultado para Mixed integer programming feasible operating region
em Repositorio de la Universidad de Cuenca
Filtro por publicador
- Aberdeen University (1)
- Academic Archive On-line (Mid Sweden University; Sweden) (1)
- Academic Research Repository at Institute of Developing Economies (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (12)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (9)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (2)
- Archive of European Integration (4)
- Aston University Research Archive (16)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (1)
- Biblioteca de Teses e Dissertações da USP (3)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (14)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (198)
- Biblioteca Virtual del Sistema Sanitario Público de Andalucía (BV-SSPA), Junta de Andalucía. Consejería de Salud y Bienestar Social, Spain (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (21)
- Brock University, Canada (5)
- Bucknell University Digital Commons - Pensilvania - USA (3)
- Bulgarian Digital Mathematics Library at IMI-BAS (11)
- CentAUR: Central Archive University of Reading - UK (12)
- Central European University - Research Support Scheme (1)
- Coffee Science - Universidade Federal de Lavras (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (2)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (14)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (4)
- Dalarna University College Electronic Archive (1)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (5)
- Digital Commons at Florida International University (11)
- Digital Peer Publishing (4)
- DigitalCommons@The Texas Medical Center (1)
- DigitalCommons@University of Nebraska - Lincoln (4)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (16)
- DRUM (Digital Repository at the University of Maryland) (5)
- Duke University (2)
- Galway Mayo Institute of Technology, Ireland (1)
- Glasgow Theses Service (1)
- Harvard University (2)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Instituto Politécnico de Bragança (2)
- Instituto Politécnico do Porto, Portugal (59)
- Martin Luther Universitat Halle Wittenberg, Germany (2)
- Massachusetts Institute of Technology (1)
- Memorial University Research Repository (1)
- National Center for Biotechnology Information - NCBI (2)
- Nottingham eTheses (3)
- Publishing Network for Geoscientific & Environmental Data (5)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (1)
- Repositorio Academico Digital UANL (1)
- Repositório Científico da Universidade de Évora - Portugal (4)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (21)
- Repositório da Produção Científica e Intelectual da Unicamp (10)
- Repositorio de la Universidad de Cuenca (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Digital da Universidade Municipal de São Caetano do Sul - USCS (2)
- Repositorio Institucional da UFLA (RIUFLA) (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (3)
- Repositório Institucional da Universidade de Brasília (1)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (171)
- Scielo Saúde Pública - SP (17)
- Scottish Institute for Research in Economics (SIRE) (SIRE), United Kingdom (2)
- The Scholarly Commons | School of Hotel Administration; Cornell University Research (2)
- Universidad de Alicante (17)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (22)
- Universidade Complutense de Madrid (1)
- Universidade do Minho (9)
- Universidade Federal do Pará (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (2)
- Universidade Metodista de São Paulo (1)
- Universidade Técnica de Lisboa (1)
- Universita di Parma (1)
- Universitat de Girona, Spain (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (4)
- Université de Lausanne, Switzerland (7)
- Université de Montréal (3)
- Université de Montréal, Canada (16)
- Université Laval Mémoires et thèses électroniques (1)
- University of Connecticut - USA (1)
- University of Michigan (21)
- University of Queensland eSpace - Australia (132)
- University of Southampton, United Kingdom (4)
- University of Washington (2)
- Worcester Research and Publications - Worcester Research and Publications - UK (2)
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.