The Maximum Weight Connected Subgraph Problem
From MaRDI portal
Recommendations
- The rooted maximum node-weight connected subgraph problem
- Algorithms for the maximum weight connected k-induced subgraph problem
- Algorithms for the constrained maximum-weight connected graph problem
- scientific article; zbMATH DE number 1300393
- Maximum weight archipelago subgraph problem
- Exploring the constrained maximum edge-weight connected graph problem
- Solving generalized maximum-weight connected subgraph problem for network enrichment analysis
- The Maximum Induced Bipartite Subgraph Problem with Edge Weights
- Maximum weighted induced subgraphs
- Finding maximum subgraphs with relatively large vertex connectivity
Cited in
(37)- Exploring the constrained maximum edge-weight connected graph problem
- Trajectory optimization under kinematical constraints for moving target search
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems
- On imposing connectivity constraints in integer programs
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Swap-vertex based neighborhood for Steiner tree problems
- A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death
- Solving generalized maximum-weight connected subgraph problem for network enrichment analysis
- Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles
- The generalized reserve set covering problem with connectivity and buffer requirements
- A branch-and-price procedure for clustering data that are graph connected
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- Multicriteria saliency detection: a (exact) robust network design approach
- Downstream protection value: detecting critical zones for effective fuel-treatment under wildfire risk
- New formulations and branch-and-cut procedures for the longest induced path problem
- Algorithms for the maximum weight connected k-induced subgraph problem
- Solving Connected Subgraph Problems in Wildlife Conservation
- scientific article; zbMATH DE number 1300393 (Why is no real title available?)
- scientific article; zbMATH DE number 1099637 (Why is no real title available?)
- Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
- Maximum weight archipelago subgraph problem
- The rooted maximum node-weight connected subgraph problem
- Imposing contiguity constraints in political districting models
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
- A new mixed integer linear programming formulation for the maximum degree bounded connected subgraph problem
- Algorithms for the constrained maximum-weight connected graph problem
- On a max-min problem concerning weights of edges
- Different Formulations for Solving the HeaviestK-Subgraph Problem
- Optimal connected subgraphs: Integer programming formulations and polyhedra
- Maximum weighted induced forests and trees: new formulations and a computational comparative review
- Solving Steiner trees: Recent advances, challenges, and perspectives
- New formulations for two location problems with interconnected facilities
- Vertex covering with capacitated trees
- Polyhedral approach to weighted connected matchings in general graphs
- A new branch-and-cut approach for the generalized regenerator location problem
This page was built for publication: The Maximum Weight Connected Subgraph Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265172)
