The generalized reserve set covering problem with connectivity and buffer requirements

DOI10.1016/j.ejor.2019.07.017zbMath1487.90538arXiv1909.04473OpenAlexW2962880104MaRDI QIDQ2029278

Markus Sinnl, Marcos Goycoolea, Ivana Ljubić, Eduardo Álvarez-Miranda

Publication date: 3 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.04473

zbMATH Keywords

combinatorial optimizationbranch-and-cutmaximum weight connected subgraph problemreserve set covering problemwildlife reserve design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (2)

Wildlife reserve design with connectivity and buffer requirements ⋮ A branch-and-cut algorithm for the edge interdiction clique problem

Cites Work

• Unnamed Item
• Optimal design of compact and functionally contiguous conservation management areas
• Reserve assemblage of critical areas: A zero-one programming approach
• Local branching
• Achieving full connectivity of sites in the multiperiod reserve network design problem
• Thinning out Steiner trees: a node-based model for uniform edge costs
• Reserve design for species preservation
• Mathematical optimization ideas for biodiversity conservation
• A new method to solve the fully connected reserve network design problem
• Optimal reserve site selection with distance requirements
• Separation algorithms for 0-1 knapsack polytopes
• Optimal Selection of a Connected Reserve Network
• Solving Connected Subgraph Problems in Wildlife Conservation
• The Rooted Maximum Node-Weight Connected Subgraph Problem
• Imposing Connectivity Constraints in Forest Planning Models
• The Maximum Weight Connected Subgraph Problem

This page was built for publication: The generalized reserve set covering problem with connectivity and buffer requirements