Vertex covering with capacitated trees
From MaRDI portal
Publication:6179715
DOI10.1002/net.22130zbMath1529.05127OpenAlexW4308862136MaRDI QIDQ6179715
Stephan Schwartz, Ralf Borndörfer, Unnamed Author
Publication date: 18 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22130
integer programmingcolumn generationgraph coveringconnected subgraphsdistrictingmaximum weight connected subgraph
Trees (05C05) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extended network interdiction problem for optimal toll control
- New models for commercial territory design
- Polyhedral study of the connected subgraph problem
- Greedoids
- Integer linear programming models for topology optimization in sheet metal design
- Solving a large scale districting problem: A case report
- The Steiner tree polytope and related polyhedra
- Arborescence polytopes for series-parallel graphs
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- Cluster analysis and mathematical programming
- 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
- Exact approaches for solving a covering problem with capacitated subtrees
- Partitioning a graph into balanced connected classes: formulations, separation and experiments
- Political districting to minimize cut edges
- An overview of graph covering and partitioning
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- Determining optimal police patrol areas with maximal covering and backup covering location models
- Political districting: from classical models to recent approaches
- Optimal duty rostering for toll enforcement inspectors
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- An Optimization Based Heuristic for Political Districting
- Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem
- A dual ascent approach for steiner tree problems on a directed graph
- Solving Connected Subgraph Problems in Wildlife Conservation
- Connections in Networks: Hardness of Feasibility Versus Optimality
- An integer linear programming approach to the steiner problem in graphs
- Solving the Steiner Tree Problem on a Graph Using Branch and Cut
- A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
- The multivariate L 1 -median and associated data depth
- Solving Steiner tree problems in graphs to optimality
- Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem
- Strong formulations for network design problems with connectivity requirements
- Network Optimization Problems: Algorithms, Applications and Complexity
- On the generalized minimum spanning tree problem
- The Rooted Maximum Node-Weight Connected Subgraph Problem
- Imposing Contiguity Constraints in Political Districting Models
- On implementing push-relabel method for the maximum flow problem
- A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems
- Imposing Connectivity Constraints in Forest Planning Models
- The Maximum Weight Connected Subgraph Problem
- A catalog of steiner tree formulations
- Models and heuristics for a minimum arborescence problem
- Optimal Political Districting by Implicit Enumeration Techniques
- Algorithms for the constrained maximum-weight connected graph problem
- An algorithm for the steiner problem in graphs
- The balanced connected subgraph problem
- A comparison of Steiner tree relaxations
- A simulated annealing approach to police district design
- Steiner Tree Problems With Profits
