1 resultado para Multi- Choice mixed integer goal programming
em Repositorio de la Universidad de Cuenca
Filtro por publicador
- Repository Napier (2)
- Aberdeen University (1)
- Academic Archive On-line (Mid Sweden University; Sweden) (1)
- AMS Campus - Alm@DL - Università di Bologna (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (19)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (7)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (7)
- Aston University Research Archive (29)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (1)
- Biblioteca de Teses e Dissertações da USP (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (17)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (10)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (3)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (34)
- Boston University Digital Common (6)
- Brock University, Canada (14)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (7)
- CaltechTHESIS (8)
- Cambridge University Engineering Department Publications Database (18)
- CentAUR: Central Archive University of Reading - UK (42)
- Central European University - Research Support Scheme (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (11)
- Cochin University of Science & Technology (CUSAT), India (3)
- Coffee Science - Universidade Federal de Lavras (1)
- Collection Of Biostatistics Research Archive (3)
- CORA - Cork Open Research Archive - University College Cork - Ireland (7)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (2)
- Dalarna University College Electronic Archive (2)
- Deakin Research Online - Australia (46)
- Department of Computer Science E-Repository - King's College London, Strand, London (3)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (1)
- Digital Commons at Florida International University (9)
- Digital Peer Publishing (3)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (4)
- DigitalCommons@University of Nebraska - Lincoln (9)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (2)
- DRUM (Digital Repository at the University of Maryland) (6)
- Duke University (3)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (7)
- Greenwich Academic Literature Archive - UK (1)
- Helda - Digital Repository of University of Helsinki (3)
- Indian Institute of Science - Bangalore - Índia (45)
- Instituto Politécnico de Bragança (1)
- Instituto Politécnico do Porto, Portugal (41)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (9)
- Memorial University Research Repository (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (58)
- Queensland University of Technology - ePrints Archive (94)
- Repositorio Academico Digital UANL (2)
- Repositório Científico da Universidade de Évora - Portugal (4)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (6)
- Repositorio de la Universidad de Cuenca (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (6)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Digital da Universidade Municipal de São Caetano do Sul - USCS (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (9)
- 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" (165)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- SAPIENTIA - Universidade do Algarve - Portugal (5)
- Savoirs UdeS : plateforme de diffusion de la production intellectuelle de l’Université de Sherbrooke - Canada (1)
- Universidad de Alicante (15)
- Universidad Politécnica de Madrid (16)
- Universidade Complutense de Madrid (1)
- Universidade de Lisboa - Repositório Aberto (3)
- Universidade Federal do Rio Grande do Norte (UFRN) (4)
- Universitat de Girona, Spain (6)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (7)
- Université de Montréal (2)
- Université de Montréal, Canada (31)
- Université Laval Mémoires et thèses électroniques (1)
- University of Michigan (14)
- University of Queensland eSpace - Australia (5)
- University of Washington (2)
- WestminsterResearch - UK (1)
- Worcester Research and Publications - Worcester Research and Publications - 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.