Solving Connected Subgraph Problems in Wildlife Conservation

DOI10.1007/978-3-642-13520-0_14MaRDI QIDQ3569923zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Wildlife corridors as a connected subgraph problem
• Improving conservation techniques through graph theoretic models
• A graph theory approach for designing conservation reserve networks with minimal fragmentation
• Polyhedral study of the connected subgraph problem
• Solving generalized maximum-weight connected subgraph problem for network enrichment analysis
• NP-hard problems in biodiversity preservation models
• The Maximum Weight Connected Subgraph Problem
• Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs

Cited in

(32)

• Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
• 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
• 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
• Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach
• Mixed-integer programming techniques for the connected max-\(k\)-cut problem
• Mathematical optimization ideas for biodiversity conservation
• Connected power domination in graphs
• Mixed integer linear programming formulation techniques
• Primal-dual approximation algorithms for node-weighted Steiner forest on planar graphs
• The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences
• 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
• The rooted maximum node-weight connected subgraph problem
• Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
• A graph theory approach for designing conservation reserve networks with minimal fragmentation
• 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?
• 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
• Optimizing the ecological connectivity of landscapes
• Wildlife reserve design with connectivity and buffer requirements
• Multi-task representation learning for mixed integer linear programming
• Ensuring connectedness for the maximum quasi-clique and densest k-subgraph problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569923)