The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
From MaRDI portal
Publication:708779
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
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2150800 (Why is no real title available?)
- scientific article; zbMATH DE number 5070513 (Why is no real title available?)
- A branch-and-cut algorithm for capacitated network design problems
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- A polyhedral approach to multicommodity survivable network design
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Automatic identification of embedded network rows in large-scale optimization models
- Bidirected and unidirected capacity installation in telecommunication networks.
- Capacitated Network Design—Polyhedral Structure and Computation
- Cover and pack inequalities for (mixed) integer programming
- Discrete optimization in public rail transport
- Faces for a linear inequality in 0–1 variables
- Facets of the knapsack polytope
- Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
- Flow pack facets of the single node fixed-charge flow polytope
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- MIPLIB 2003
- Minimum cost capacity installation for multicommodity network flows
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Network flows. Theory, algorithms, and applications.
- On capacitated network design cut-set polyhedra
- On cut-based inequalities for capacitated network design polyhedra
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- On the \(0/1\) knapsack polytope
- On the facets of the mixed-integer knapsack polyhedron
- Polyhedral results for the edge capacity polytope.
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- SCIP: solving constraint integer programs
- Sequence independent lifting in mixed integer programming
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Source sink flows with capacity installation in batches
- The 0-1 knapsack problem with a single continuous variable
- The convex hull of two core capacitated network design problems
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- Valid Linear Inequalities for Fixed Charge Problems
- Valid inequalities for mixed 0-1 programs
- Valid inequalities for problems with additive variable upper bounds
Cited in
(12)- Detecting semantic groups in MIP models
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- Progress in mathematical programming solvers from 2001 to 2020
- Generalized coefficient strengthening cuts for mixed integer programming
- A note on capacity models for network design
- Theoretical challenges towards cutting-plane selection
- Steiner tree packing revisited
- Lifting for the integer knapsack cover polyhedron
- Multi-commodity variable upper bound flow models
Describes a project that uses
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)
