1 resultado para Relax-and-fix heuristic
em Repositorio de la Universidad de Cuenca
Filtro por publicador
- Aberdeen University (1)
- Abertay Research Collections - Abertay University’s repository (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (17)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (5)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (3)
- Archive of European Integration (5)
- Aston University Research Archive (32)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (22)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (29)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (47)
- Brock University, Canada (9)
- Bucknell University Digital Commons - Pensilvania - USA (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (8)
- CentAUR: Central Archive University of Reading - UK (31)
- Cochin University of Science & Technology (CUSAT), India (4)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (2)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (33)
- Cor-Ciencia - Acuerdo de Bibliotecas Universitarias de Córdoba (ABUC), Argentina (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (3)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- Dalarna University College Electronic Archive (10)
- Department of Computer Science E-Repository - King's College London, Strand, London (4)
- Digital Commons - Michigan Tech (9)
- Digital Commons at Florida International University (14)
- Digital Peer Publishing (3)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (6)
- DigitalCommons@University of Nebraska - Lincoln (2)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (12)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (4)
- Ecology and Society (1)
- Glasgow Theses Service (1)
- Greenwich Academic Literature Archive - UK (1)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (4)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Politécnico do Porto, Portugal (20)
- Instituto Superior de Psicologia Aplicada - Lisboa (1)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (7)
- Laboratório Nacional de Energia e Geologia - Portugal (1)
- Massachusetts Institute of Technology (1)
- National Center for Biotechnology Information - NCBI (11)
- Nottingham eTheses (16)
- Ohio University (1)
- Portal de Revistas Científicas Complutenses - Espanha (3)
- Portal do Conhecimento - Ministerio do Ensino Superior Ciencia e Inovacao, Cape Verde (1)
- Publishing Network for Geoscientific & Environmental Data (11)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (2)
- Repositorio Academico Digital UANL (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (2)
- Repositório da Produção Científica e Intelectual da Unicamp (313)
- Repositorio de la Universidad de Cuenca (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (9)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Institucional da Universidade Federal de Goiás - UFG (1)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (78)
- Royal College of Art Research Repository - Uninet Kingdom (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (5)
- 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 (2)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (17)
- Universidade Complutense de Madrid (1)
- Universidade do Minho (3)
- Universidade Estadual Paulista "Júlio de Mesquita Filho" (UNESP) (1)
- Universidade Federal do Pará (5)
- Universidade Federal do Rio Grande do Norte (UFRN) (2)
- Universitat de Girona, Spain (4)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (5)
- Université de Lausanne, Switzerland (17)
- Université de Montréal (1)
- Université de Montréal, Canada (14)
- University of Canberra Research Repository - Australia (1)
- University of Connecticut - USA (1)
- University of Michigan (10)
- University of Queensland eSpace - Australia (20)
- University of Washington (3)
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.