Solving Connected Subgraph Problems in Wildlife Conservation

DOI10.1007/978-3-642-13520-0_14zbMath1285.68155OpenAlexW1563728026MaRDI QIDQ3569923

Bistra Dilkina, Carla P. Gomes

Publication date: 22 June 2010

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13520-0_14

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Connectivity (05C40)

Related Items (27)

Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach ⋮ Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences ⋮ Achieving full connectivity of sites in the multiperiod reserve network design problem ⋮ A relax-and-cut framework for large-scale maximum weight connected subgraph problems ⋮ Local branching relaxation heuristics for integer linear programs ⋮ Optimal connected subgraphs: Integer programming formulations and polyhedra ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ An integer program for positive semidefinite zero forcing in graphs ⋮ How close is a quad mesh to a polycube? ⋮ Connected power domination in graphs ⋮ Fair and Efficient Allocation of Scarce Resources Based on Predicted Outcomes: Implications for Homeless Service Delivery ⋮ A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem ⋮ Vertex covering with capacitated trees ⋮ Wildlife reserve design with connectivity and buffer requirements ⋮ Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems ⋮ Wildlife corridors as a connected subgraph problem ⋮ Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem ⋮ Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches ⋮ Solving the quorumcast routing problem by constraint programming ⋮ Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs ⋮ Mixed-integer programming techniques for the connected max-\(k\)-cut problem ⋮ Global optimization of multilevel electricity market models including network design and graph partitioning ⋮ Minimizing landscape resistance for habitat conservation ⋮ The generalized reserve set covering problem with connectivity and buffer requirements ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Mathematical optimization ideas for biodiversity conservation

This page was built for publication: Solving Connected Subgraph Problems in Wildlife Conservation