Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach

DOI10.1007/s11590-021-01745-wzbMath1489.90205OpenAlexW3170479471MaRDI QIDQ2119732

Art Rodgers, Rob Rempel, Denys Yemshanov, Ning Liu, Robert G. Haight, Frank H. Koch

Publication date: 30 March 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01745-w

zbMATH Keywords

mixed integer programmingnetwork flow modelroad constructionhabitat connectivityharvest scheduling model Iwildlife corridorwoodland caribou

Mathematics Subject Classification ID

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

Related Items (1)

Fifty years of operational research in forestry

Uses Software

• Gurobi
• GAMS

Cites Work

• Wildlife corridors as a connected subgraph problem
• Using separation algorithms to generate mixed integer model reformulations
• Achieving full connectivity of sites in the multiperiod reserve network design problem
• Model tightening for integrated timber harvest and transportation planning
• A new method to solve the fully connected reserve network design problem
• Upgrading Shortest Paths in Networks
• Optimal Selection of a Connected Reserve Network
• Solving Connected Subgraph Problems in Wildlife Conservation
• A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation
• Imposing Connectivity Constraints in Forest Planning Models
• A graph theory approach for designing conservation reserve networks with minimal fragmentation

This page was built for publication: Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach