Recommendations
- Exact approaches for solving a covering problem with capacitated subtrees
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- scientific article; zbMATH DE number 2119748
- The Maximum Weight Connected Subgraph Problem
- Algorithms for the constrained maximum-weight connected graph problem
Cites work
- A catalog of steiner tree formulations
- A comparison of Steiner tree relaxations
- A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
- A dual ascent approach for steiner tree problems on a directed graph
- A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems
- A simulated annealing approach to police district design
- Algorithms for the constrained maximum-weight connected graph problem
- An algorithm for the steiner problem in graphs
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- An extended network interdiction problem for optimal toll control
- An integer linear programming approach to the steiner problem in graphs
- An optimization based heuristic for political districting
- An overview of graph covering and partitioning
- Arborescence polytopes for series-parallel graphs
- Cluster analysis and mathematical programming
- Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
- Connections in Networks: Hardness of Feasibility Versus Optimality
- Determining optimal police patrol areas with maximal covering and backup covering location models
- Exact approaches for solving a covering problem with capacitated subtrees
- Greedoids
- scientific article; zbMATH DE number 5621997 (Why is no real title available?)
- scientific article; zbMATH DE number 4010182 (Why is no real title available?)
- scientific article; zbMATH DE number 1300393 (Why is no real title available?)
- scientific article; zbMATH DE number 1769298 (Why is no real title available?)
- scientific article; zbMATH DE number 742961 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- Imposing Connectivity Constraints in Forest Planning Models
- Imposing contiguity constraints in political districting models
- Integer linear programming models for topology optimization in sheet metal design
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- Models and heuristics for a minimum arborescence problem
- Network Optimization Problems: Algorithms, Applications and Complexity
- New models for commercial territory design
- On implementing push-relabel method for the maximum flow problem
- On imposing connectivity constraints in integer programs
- On the generalized minimum spanning tree problem
- Optimal duty rostering for toll enforcement inspectors
- Optimal Political Districting by Implicit Enumeration Techniques
- Partitioning a graph into balanced connected classes: formulations, separation and experiments
- Political districting to minimize cut edges
- Political districting: from classical models to recent approaches
- Polyhedral study of the connected subgraph problem
- Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem
- Solving a large scale districting problem: A case report
- Solving Connected Subgraph Problems in Wildlife Conservation
- Solving Steiner tree problems in graphs to optimality
- Solving the Steiner Tree Problem on a Graph Using Branch and Cut
- Steiner Tree Problems With Profits
- Strong formulations for network design problems with connectivity requirements
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- The Maximum Weight Connected Subgraph Problem
- The multivariate L 1 -median and associated data depth
- The rooted maximum node-weight connected subgraph problem
- The Steiner tree polytope and related polyhedra
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- Thinning out Steiner trees: a node-based model for uniform edge costs
Cited in
(5)- Exact approaches for solving a covering problem with capacitated subtrees
- Vertex cover meets scheduling
- Replica Placement via Capacitated Vertex Cover
- Optimizing connected components graph partitioning with minimum size constraints using integer programming and spectral clustering techniques
- Two fixed-parameter algorithms for vertex covering by paths on trees
This page was built for publication: Vertex covering with capacitated trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179715)
