The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
DOI10.1007/S12532-010-0015-3zbMATH Open1200.65042OpenAlexW2080560296MaRDI QIDQ708779FDOQ708779
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
Recommendations
- A polyhedral approach to an integer multicommodity flow problem
- MIPping closures: An instant survey
- Structural investigation of piecewise linearized network flow problems
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- A mixed integer model for the sparsest cut problem
graphnumerical examplesmixed integer programmingbranch-and-cut librariesC{\texttt{PLEX}}cut-based inequalitiesnetwork detectionS{\texttt{CIP}}
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cites Work
- MIPLIB 2003
- Title not available (Why is that?)
- SCIP: solving constraint integer programs
- Title not available (Why is that?)
- The 0-1 knapsack problem with a single continuous variable
- On the facets of the mixed-integer knapsack polyhedron
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- Sequence independent lifting in mixed integer programming
- Faces for a linear inequality in 0–1 variables
- Facets of the knapsack polytope
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- The convex hull of two core capacitated network design problems
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Minimum cost capacity installation for multicommodity network flows
- On capacitated network design cut-set polyhedra
- On cut-based inequalities for capacitated network design polyhedra
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- Capacitated Network Design—Polyhedral Structure and Computation
- Title not available (Why is that?)
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Cover and pack inequalities for (mixed) integer programming
- Valid inequalities for mixed 0-1 programs
- Valid Linear Inequalities for Fixed Charge Problems
- 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
- Polyhedral results for the edge capacity polytope.
- Automatic identification of embedded network rows in large-scale optimization models
- Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
- Title not available (Why is that?)
- Discrete optimization in public rail transport
- A polyhedral approach to multicommodity survivable network design
- On the \(0/1\) knapsack polytope
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- A branch-and-cut algorithm for capacitated network design problems
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Source sink flows with capacity installation in batches
- Bidirected and unidirected capacity installation in telecommunication networks.
- Shortest paths, single origin‐destination network design, and associated polyhedra
Cited In (11)
- Progress in mathematical programming solvers from 2001 to 2020
- Generalized coefficient strengthening cuts for mixed integer programming
- Steiner tree packing revisited
- Lifting for the integer knapsack cover polyhedron
- Multi-commodity variable upper bound flow models
- Theoretical challenges towards cutting-plane selection
- A note on capacity models for network design
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- 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
- Structure-driven fix-and-propagate heuristics for mixed integer programming
Uses Software
This page was built for publication: The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708779)
