Vertex covering with capacitated trees (Q6179715)

scientific article; zbMATH DE number 7780113

Language	Label	Description	Also known as
English	Vertex covering with capacitated trees	scientific article; zbMATH DE number 7780113

Statements

instance of

scholarly article

0 references

title

Vertex covering with capacitated trees (English)

0 references

0 references

0 references

0 references

0 references

18 December 2023

0 references

zbMATH Keywords

column generation

0 references

connected subgraphs

0 references

districting

0 references

graph covering

0 references

integer programming

0 references

maximum weight connected subgraph

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1002/net.22130

0 references

cites work

The Maximum Weight Connected Subgraph Problem

0 references

The Rooted Maximum Node-Weight Connected Subgraph Problem

0 references

A relax-and-cut framework for large-scale maximum weight connected subgraph problems

0 references

An integer linear programming approach to the steiner problem in graphs

0 references

An algorithm for the steiner problem in graphs

0 references

The balanced connected subgraph problem

0 references

Polyhedral study of the connected subgraph problem

0 references

Optimal duty rostering for toll enforcement inspectors

0 references

An extended network interdiction problem for optimal toll control

0 references

Imposing Connectivity Constraints in Forest Planning Models

0 references

On implementing push-relabel method for the maximum flow problem

0 references

A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem

0 references

Solving the Steiner Tree Problem on a Graph Using Branch and Cut

0 references

The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets

0 references

Exact approaches for solving a covering problem with capacitated subtrees

0 references

Connections in Networks: Hardness of Feasibility Versus Optimality

0 references

Steiner Tree Problems With Profits

0 references

Determining optimal police patrol areas with maximal covering and backup covering location models

0 references

A simulated annealing approach to police district design

0 references

Solving Connected Subgraph Problems in Wildlife Conservation

0 references

Models and heuristics for a minimum arborescence problem

0 references

Thinning out Steiner trees: a node-based model for uniform edge costs

0 references

Solving a large scale districting problem: A case report

0 references

Integer linear programming models for topology optimization in sheet metal design

0 references

Optimal Political Districting by Implicit Enumeration Techniques

0 references

Arborescence polytopes for series-parallel graphs

0 references

The Steiner tree polytope and related polyhedra

0 references

A catalog of steiner tree formulations

0 references

Cluster analysis and mathematical programming

0 references

Q4763403

0 references

Mixed-integer programming techniques for the connected max-\(k\)-cut problem

0 references

Network Optimization Problems: Algorithms, Applications and Complexity

0 references

Solving Steiner tree problems in graphs to optimality

0 references

Greedoids

0 references

Algorithms for the constrained maximum-weight connected graph problem

0 references

Q4248932

0 references

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems

0 references

An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem

0 references

Q3760270

0 references

Strong formulations for network design problems with connectivity requirements

0 references

Q4845371

0 references

An Optimization Based Heuristic for Political Districting

0 references

Partitioning a graph into balanced connected classes: formulations, separation and experiments

0 references

On the generalized minimum spanning tree problem

0 references

A comparison of Steiner tree relaxations

0 references

Q3638643

0 references

The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances

0 references

Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem

0 references

Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem

0 references

Political districting: from classical models to recent approaches

0 references

New models for commercial territory design

0 references

An overview of graph covering and partitioning

0 references

Q4540048

0 references

Political districting to minimize cut edges

0 references

Imposing Contiguity Constraints in Political Districting Models

0 references

The multivariate <i>L</i> <sub>1</sub> -median and associated data depth

0 references

On imposing connectivity constraints in integer programs

0 references

A dual ascent approach for steiner tree problems on a directed graph

0 references

Identifiers

zbMATH Open document ID

1529.05127

0 references

DOI

10.1002/net.22130

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6179715