Wildlife reserve design with connectivity and buffer requirements

DOI10.1111/itor.13230OpenAlexW4309758494MaRDI QIDQ6195027

Unnamed Author

Publication date: 12 March 2024

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13230

zbMATH Keywords

combinatorial optimizationinteger linear programmingwildlife reserve designconnectivity and buffer requirementspolynomial-sized formulations

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• The generalized reserve set covering problem with connectivity and buffer requirements
• Mathematical optimization ideas for biodiversity conservation
• Optimal Selection of a Connected Reserve Network
• Solving Connected Subgraph Problems in Wildlife Conservation
• Connections in Networks: Hardness of Feasibility Versus Optimality
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• Imposing Connectivity Constraints in Forest Planning Models
• Unnamed Item

This page was built for publication: Wildlife reserve design with connectivity and buffer requirements