Optimizing the ecological connectivity of landscapes

DOI10.1002/net.22131zbMath1529.90065OpenAlexW4309491274MaRDI QIDQ6179718

Unnamed Author, Basile Couëtoux, Unnamed Author, Yann Vaxès

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

shortest pathcombinatorial optimizationmixed integer linear programmingnetwork flowlandscape connectivityenvironment and climate change

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Reduction approaches for robust shortest path problems
• Mathematical optimization ideas for biodiversity conservation
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• A new approach to dynamic all pairs shortest paths

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