Wildlife corridors as a connected subgraph problem

DOI10.1016/j.jeem.2011.08.001zbMath1250.90119OpenAlexW2027469956MaRDI QIDQ456412

Jordan F. Suter, Jon M. Conrad, Ashish Sabharwal, Willem-Jan van Hoeve, Carla P. Gomes

Publication date: 25 October 2012

Published in: Journal of Environmental Economics and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jeem.2011.08.001

zbMATH Keywords

optimizationmixed integer programmingcomputational sustainabilityhabitat fragmentationwildlife corridors

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Ecology (92D40)

Related Items (11)

Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach ⋮ The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences ⋮ Optimal design of compact and functionally contiguous conservation management areas ⋮ Stochastic control of ecological networks ⋮ Achieving full connectivity of sites in the multiperiod reserve network design problem ⋮ Network connectivity value ⋮ Downstream protection value: detecting critical zones for effective fuel-treatment under wildfire risk ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ SPACETIME DISCOUNTED VALUE OF NETWORK CONNECTIVITY ⋮ Mathematical optimization ideas for biodiversity conservation ⋮ A new method to solve the fully connected reserve network design problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• On the hardness of approximating minimum vertex cover
• The Steiner problem with edge lengths 1 and 2
• Optimal Selection of a Connected Reserve Network
• Solving Connected Subgraph Problems in Wildlife Conservation

This page was built for publication: Wildlife corridors as a connected subgraph problem