Wildlife corridors as a connected subgraph problem

DOI10.1016/J.JEEM.2011.08.001MaRDI QIDQ456412zbMATH OpenOpenAlexFDO

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

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) Ecology (92D40) Mixed integer programming (90C11)

Recommendations

• Solving Connected Subgraph Problems in Wildlife Conservation
• Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach
• Minimizing landscape resistance for habitat conservation
• A graph theory approach for designing conservation reserve networks with minimal fragmentation
• The generalized reserve set covering problem with connectivity and buffer requirements

Cites work

• scientific article; zbMATH DE number 970831 (Why is no real title available?)
• On the hardness of approximating minimum vertex cover
• Optimal Selection of a Connected Reserve Network
• Solving Connected Subgraph Problems in Wildlife Conservation
• The Steiner problem with edge lengths 1 and 2

Cited in

(18)

• Downstream protection value: detecting critical zones for effective fuel-treatment under wildfire risk
• Mathematical optimization ideas for biodiversity conservation
• Minimizing landscape resistance for habitat conservation
• A new method to solve the fully connected reserve network design problem
• Stochastic control of ecological networks
• Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach
• Achieving full connectivity of sites in the multiperiod reserve network design problem
• Solving Connected Subgraph Problems in Wildlife Conservation
• Predicting wildlife trafficking routes with differentiable shortest paths
• Network connectivity value
• Designing higher value roads to preserve species at risk by optimally controlling traffic flow
• Optimizing the ecological connectivity of landscapes
• The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences
• Optimal design of compact and functionally contiguous conservation management areas
• A graph theory approach for designing conservation reserve networks with minimal fragmentation
• Solving Steiner trees: Recent advances, challenges, and perspectives
• SPACETIME DISCOUNTED VALUE OF NETWORK CONNECTIVITY
• Placing green bridges optimally, with a multivariate analysis

Describes a project that uses

Uses Software

• CPLEX

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456412)