Optimizing the ecological connectivity of landscapes

DOI10.1002/NET.22131MaRDI QIDQ6179718zbMATH OpenOpenAlexFDO

Authors Basile Couëtoux, Yann Vaxès

Publication date 18 December 2023

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/net.22131

zbMATH Keywords

combinatorial optimizationenvironment and climate changelandscape connectivitymixed integer linear programmingnetwork flowshortest path

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Wildlife corridors as a connected subgraph problem
• Solving Connected Subgraph Problems in Wildlife Conservation
• Minimizing landscape resistance for habitat conservation
• A new method to solve the fully connected reserve network design problem
• Placing green bridges optimally, with a multivariate analysis

Cites work

• A new approach to dynamic all pairs shortest paths
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Mathematical optimization ideas for biodiversity conservation
• Network flows. Theory, algorithms, and applications.
• Reduction approaches for robust shortest path problems

Cited in

(3)

• Placing Green bridges optimally, with a multivariate analysis
• Optimal design of compact and functionally contiguous conservation management areas
• Placing green bridges optimally, with a multivariate analysis

This page was built for publication: Optimizing the ecological connectivity of landscapes

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