1 resultado para Lagrangian Formulation
em Repositorio de la Universidad de Cuenca
Filtro por publicador
- Aberdeen University (2)
- Academic Research Repository at Institute of Developing Economies (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (6)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (5)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- Aquatic Commons (9)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (5)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (2)
- Archive of European Integration (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (45)
- Biblioteca de Teses e Dissertações da USP (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) (16)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (4)
- Bioline International (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (22)
- Brock University, Canada (2)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (4)
- Cambridge University Engineering Department Publications Database (67)
- CentAUR: Central Archive University of Reading - UK (55)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (23)
- Cochin University of Science & Technology (CUSAT), India (1)
- Coffee Science - Universidade Federal de Lavras (2)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (27)
- CORA - Cork Open Research Archive - University College Cork - Ireland (3)
- Digital Archives@Colby (1)
- Digital Commons - Michigan Tech (1)
- Digital Commons at Florida International University (4)
- DigitalCommons - The University of Maine Research (1)
- Diposit Digital de la UB - Universidade de Barcelona (1)
- Duke University (6)
- Earth Simulator Research Results Repository (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (5)
- FUNDAJ - Fundação Joaquim Nabuco (3)
- Glasgow Theses Service (2)
- Greenwich Academic Literature Archive - UK (12)
- Helda - Digital Repository of University of Helsinki (1)
- Indian Institute of Science - Bangalore - Índia (50)
- Institutional Repository of Leibniz University Hannover (1)
- INSTITUTO DE PESQUISAS ENERGÉTICAS E NUCLEARES (IPEN) - Repositório Digital da Produção Técnico Científica - BibliotecaTerezine Arantes Ferra (3)
- Instituto Politécnico do Porto, Portugal (2)
- Línguas & Letras - Unoeste (2)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (2)
- Memorial University Research Repository (1)
- National Center for Biotechnology Information - NCBI (2)
- Nottingham eTheses (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (19)
- Publishing Network for Geoscientific & Environmental Data (4)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (72)
- Queensland University of Technology - ePrints Archive (126)
- 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 (1)
- Repositorio de la Universidad de Cuenca (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (2)
- Repositório Institucional da Universidade de Aveiro - Portugal (4)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositorio Institucional de la Universidad Pública de Navarra - Espanha (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (119)
- 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 (3)
- Savoirs UdeS : plateforme de diffusion de la production intellectuelle de l’Université de Sherbrooke - Canada (1)
- Scielo España (1)
- Universidad de Alicante (2)
- Universidad Politécnica de Madrid (32)
- Universidade Estadual Paulista "Júlio de Mesquita Filho" (UNESP) (2)
- Universidade Federal do Pará (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (3)
- Universita di Parma (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (2)
- Université de Lausanne, Switzerland (2)
- Université de Montréal (1)
- Université de Montréal, Canada (15)
- Université Laval Mémoires et thèses électroniques (1)
- University of Michigan (14)
- University of Queensland eSpace - Australia (18)
- University of Washington (2)
- 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.