Pages that link to "Item:Q3569923"
From MaRDI portal
The following pages link to Solving Connected Subgraph Problems in Wildlife Conservation (Q3569923):
Displaying 27 items.
- The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences (Q320748) (← links)
- Wildlife corridors as a connected subgraph problem (Q456412) (← links)
- Solving the quorumcast routing problem by constraint programming (Q487641) (← links)
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
- Achieving full connectivity of sites in the multiperiod reserve network design problem (Q1652228) (← links)
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- Global optimization of multilevel electricity market models including network design and graph partitioning (Q2010915) (← links)
- Minimizing landscape resistance for habitat conservation (Q2011583) (← links)
- The generalized reserve set covering problem with connectivity and buffer requirements (Q2029278) (← links)
- Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach (Q2119732) (← links)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- Mathematical optimization ideas for biodiversity conservation (Q2356177) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (Q3012847) (← links)
- Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem (Q4620424) (← links)
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (Q4622891) (← links)
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)
- A graph theory approach for designing conservation reserve networks with minimal fragmentation (Q5449669) (← links)
- Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- An integer program for positive semidefinite zero forcing in graphs (Q6092625) (← links)
- How close is a quad mesh to a polycube? (Q6101842) (← links)
- Fair and Efficient Allocation of Scarce Resources Based on Predicted Outcomes: Implications for Homeless Service Delivery (Q6135979) (← links)
- A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem (Q6164361) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)
- Wildlife reserve design with connectivity and buffer requirements (Q6195027) (← links)