On imposing connectivity constraints in integer programs
DOI10.1007/s10107-017-1117-8zbMath1386.90023OpenAlexW2586469794MaRDI QIDQ1683690
Austin Buchanan, Sergiy I. Butenko, Yi-Ming Wang
Publication date: 1 December 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-017-1117-8
contiguityconnectivity constraintsconnected subgraph polytopemaximum-weight connected subgraphprize-collecting Steiner tree
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connected dominating set. Theory and applications
- Polyhedral study of the connected subgraph problem
- Greedoids
- Geometric algorithms and combinatorial optimization.
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Strong lower bounds for the prize collecting Steiner problem in graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets
- Imposing Connectivity Constraints in Forest Planning Models
- The Maximum Weight Connected Subgraph Problem
- Optimal Political Districting by Implicit Enumeration Techniques
- The NP-completeness column: An ongoing guide
This page was built for publication: On imposing connectivity constraints in integer programs