Generalized coefficient strengthening cuts for mixed integer programming
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1041084 (Why is no real title available?)
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
- Conflict analysis in mixed integer programming
- Conflict graphs in solving integer programming problems
- Disjunctive Programming
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Lifted flow cover inequalities for mixed 0-1 integer programs
- MIPLIB 2003
- Mixed integer programming: analyzing 12 years of progress
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- On the \(0/1\) knapsack polytope
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Presolve Reductions in Mixed Integer Programming
- Solving Large-Scale Zero-One Linear Programming Problems
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- The convex hull of two core capacitated network design problems
- Valid Linear Inequalities for Fixed Charge Problems
- Valid inequalities and separation for uncapacitated fixed charge networks
Cited in
(5)
This page was built for publication: Generalized coefficient strengthening cuts for mixed integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683740)