A new method to solve the fully connected reserve network design problem

DOI10.1016/j.ejor.2013.05.015zbMath1317.90048OpenAlexW2042558818WikidataQ58645874 ScholiaQ58645874MaRDI QIDQ2356224

Nahid Jafari, John W. Hearne

Publication date: 29 July 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.05.015

zbMATH Keywords

compactnessmixed integer programmingcontiguitysite selectionreserve network design problemspatial optimisation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Ecology (92D40)

Related Items (6)

Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach ⋮ Optimal design of compact and functionally contiguous conservation management areas ⋮ Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach ⋮ Achieving full connectivity of sites in the multiperiod reserve network design problem ⋮ The generalized reserve set covering problem with connectivity and buffer requirements ⋮ Fuel treatment planning: fragmenting high fuel load areas while maintaining availability and connectivity of faunal habitat

Cites Work

• Wildlife corridors as a connected subgraph problem
• Multiobjective programming methods in the reserve selection problem.
• Requiring connectivity in the set covering problem
• Optimal Selection of a Connected Reserve Network
• A graph theory approach for designing conservation reserve networks with minimal fragmentation

This page was built for publication: A new method to solve the fully connected reserve network design problem