The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
From MaRDI portal
Publication:708779
DOI10.1007/s12532-010-0015-3zbMath1200.65042OpenAlexW2080560296MaRDI QIDQ708779
Christian Raack, Tobias Achterberg
Publication date: 14 October 2010
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-010-0015-3
graphnumerical examplesmixed integer programmingbranch-and-cut librariesC{\texttt{PLEX}}cut-based inequalitiesnetwork detectionS{\texttt{CIP}}
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Theoretical challenges towards cutting-plane selection, A note on capacity models for network design, Steiner tree packing revisited, Lifting for the integer knapsack cover polyhedron, Progress in mathematical programming solvers from 2001 to 2020, Generalized coefficient strengthening cuts for mixed integer programming, Multi-commodity variable upper bound flow models, Structure-driven fix-and-propagate heuristics for mixed integer programming, An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron, Face dimensions of general-purpose cutting planes for mixed-integer linear programs, The maximum balanced subgraph of a signed graph: applications and solution approaches
Uses Software
Cites Work
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- The convex hull of two core capacitated network design problems
- SCIP: solving constraint integer programs
- Cover and pack inequalities for (mixed) integer programming
- Valid inequalities for mixed 0-1 programs
- Source sink flows with capacity installation in batches
- Minimum cost capacity installation for multicommodity network flows
- The 0-1 knapsack problem with a single continuous variable
- A polyhedral approach to multicommodity survivable network design
- Discrete optimization in public rail transport
- On the \(0/1\) knapsack polytope
- Bidirected and unidirected capacity installation in telecommunication networks.
- On the facets of the mixed-integer knapsack polyhedron
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- Polyhedral results for the edge capacity polytope.
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- A branch-and-cut algorithm for capacitated network design problems
- On capacitated network design cut-set polyhedra
- Sequence independent lifting in mixed integer programming
- MIPLIB 2003
- On cut-based inequalities for capacitated network design polyhedra
- Automatic identification of embedded network rows in large-scale optimization models
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Valid Linear Inequalities for Fixed Charge Problems
- Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
- Faces for a linear inequality in 0–1 variables
- Facets of the knapsack polytope
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Capacitated Network Design—Polyhedral Structure and Computation
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Flow pack facets of the single node fixed-charge flow polytope
- Valid inequalities for problems with additive variable upper bounds
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
