Achieving full connectivity of sites in the multiperiod reserve network design problem

DOI10.1016/j.cor.2016.12.017zbMath1391.90115DBLPjournals/cor/JafariNMDH17OpenAlexW2561859520WikidataQ56524081 ScholiaQ56524081MaRDI QIDQ1652228

Clinton T. Moore, Bryan L. Nuse, Jeffrey Hepinstall-Cymerman, Nahid Jafari, Bistra Dilkina

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.12.017

zbMATH Keywords

mixed integer programmingdynamic reserve site selectionreserve network designreserve site selectionspatial connectivity

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (3)

Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach ⋮ A multi-objective districting problem applied to agricultural machinery maintenance service network ⋮ The generalized reserve set covering problem with connectivity and buffer requirements

Cites Work

• A multi-criteria police districting problem for the efficient and effective design of patrol sector
• The coastal seaspace patrol sector design and allocation problem
• Wildlife corridors as a connected subgraph problem
• The orienteering problem: a survey
• A distributed approach to capacity allocation in logical networks
• General network design: a unified view of combined location and network design problems
• Mathematical optimization ideas for biodiversity conservation
• A new method to solve the fully connected reserve network design problem
• Dynamic Reserve Selection: Optimal Land Retention with Land-Price Feedbacks
• Approximate Dynamic Programming
• Optimal Selection of a Connected Reserve Network
• Solving Connected Subgraph Problems in Wildlife Conservation
• School redistricting: embedding GIS tools with integer programming
• Imposing Connectivity Constraints in Forest Planning Models
• A graph theory approach for designing conservation reserve networks with minimal fragmentation
• Optimal Political Districting by Implicit Enumeration Techniques

This page was built for publication: Achieving full connectivity of sites in the multiperiod reserve network design problem