1 resultado para logical structure method
em Repositorio de la Universidad de Cuenca
Filtro por publicador
- Repository Napier (1)
- Abertay Research Collections - Abertay University’s repository (2)
- Academic Archive On-line (Karlstad University; Sweden) (1)
- Academic Research Repository at Institute of Developing Economies (3)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (14)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (9)
- Aquatic Commons (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (12)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (2)
- Aston University Research Archive (30)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (23)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (169)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (19)
- Brock University, Canada (5)
- Bucknell University Digital Commons - Pensilvania - USA (4)
- Bulgarian Digital Mathematics Library at IMI-BAS (11)
- CaltechTHESIS (1)
- CentAUR: Central Archive University of Reading - UK (56)
- Cochin University of Science & Technology (CUSAT), India (6)
- Coffee Science - Universidade Federal de Lavras (1)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (26)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- CUNY Academic Works (1)
- Department of Computer Science E-Repository - King's College London, Strand, London (2)
- Digital Commons - Michigan Tech (4)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (13)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (6)
- Diposit Digital de la UB - Universidade de Barcelona (6)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (14)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (5)
- Fachlicher Dokumentenserver Paedagogik/Erziehungswissenschaften (1)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Glasgow Theses Service (3)
- Greenwich Academic Literature Archive - UK (1)
- INSTITUTO DE PESQUISAS ENERGÉTICAS E NUCLEARES (IPEN) - Repositório Digital da Produção Técnico Científica - BibliotecaTerezine Arantes Ferra (1)
- Instituto Politécnico de Bragança (1)
- Instituto Politécnico do Porto, Portugal (1)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (3)
- Memorial University Research Repository (2)
- National Center for Biotechnology Information - NCBI (23)
- Nottingham eTheses (2)
- Portal de Revistas Científicas Complutenses - Espanha (2)
- Publishing Network for Geoscientific & Environmental Data (2)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (5)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (4)
- Repositório da Produção Científica e Intelectual da Unicamp (40)
- Repositório da Universidade Federal do Espírito Santo (UFES), Brazil (1)
- Repositorio de la Universidad de Cuenca (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (5)
- Repositório do ISCTE - Instituto Universitário de Lisboa (1)
- Repositório Institucional da Universidade de Brasília (1)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (190)
- Repositorio Institucional Universidad EAFIT - Medelin - Colombia (2)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (5)
- Savoirs UdeS : plateforme de diffusion de la production intellectuelle de l’Université de Sherbrooke - Canada (1)
- Scielo Saúde Pública - SP (24)
- Scottish Institute for Research in Economics (SIRE) (SIRE), United Kingdom (1)
- Universidad de Alicante (7)
- Universidad del Rosario, Colombia (3)
- Universidad Politécnica de Madrid (33)
- Universidade Complutense de Madrid (1)
- Universidade do Minho (5)
- Universidade Federal do Pará (4)
- Universidade Federal do Rio Grande do Norte (UFRN) (2)
- Universita di Parma (1)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (12)
- Université de Lausanne, Switzerland (21)
- Université de Montréal (1)
- Université de Montréal, Canada (13)
- Université Laval Mémoires et thèses électroniques (2)
- University of Canberra Research Repository - Australia (1)
- University of Michigan (7)
- University of Queensland eSpace - Australia (45)
- University of Washington (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.