Pages that link to "Item:Q5265172"

The following pages link to The Maximum Weight Connected Subgraph Problem (Q5265172):

Displaying 34 items.

• Maximum weight archipelago subgraph problem (Q490157) (← links)
• A new branch-and-cut approach for the generalized regenerator location problem (Q827283) (← links)
• Exploring the constrained maximum edge-weight connected graph problem (Q1048254) (← links)
• Trajectory optimization under kinematical constraints for moving target search (Q1651570) (← links)
• A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
• On imposing connectivity constraints in integer programs (Q1683690) (← links)
• Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
• Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
• A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death (Q1699920) (← links)
• Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767) (← links)
• Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles (Q1799950) (← links)
• The generalized reserve set covering problem with connectivity and buffer requirements (Q2029278) (← links)
• A branch-and-price procedure for clustering data that are graph connected (Q2060392) (← links)
• Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
• Multicriteria saliency detection: a (exact) robust network design approach (Q2178371) (← links)
• Downstream protection value: detecting critical zones for effective fuel-treatment under wildfire risk (Q2668685) (← links)
• New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← links)
• Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (Q2942405) (← links)
• Solving Connected Subgraph Problems in Wildlife Conservation (Q3569923) (← links)
• (Q4248932) (← links)
• (Q4369618) (← links)
• Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem (Q4620424) (← links)
• Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
• On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)
• A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems (Q5131733) (← links)
• A new mixed integer linear programming formulation for the maximum degree bounded connected subgraph problem (Q5279220) (← links)
• Algorithms for the constrained maximum-weight connected graph problem (Q5689649) (← links)
• On a max-min problem concerning weights of edges (Q5955207) (← links)
• Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
• Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• New formulations for two location problems with interconnected facilities (Q6128897) (← links)
• Vertex covering with capacitated trees (Q6179715) (← links)
• Polyhedral approach to weighted connected matchings in general graphs (Q6633527) (← links)