Generalized coefficient strengthening cuts for mixed integer programming

DOI10.1007/s10898-017-0562-5zbMath1394.90434OpenAlexW2753502463MaRDI QIDQ683740

Wei-Kun Chen, Liang Chen, Mu-Ming Yang, Yu-Hong Dai

Publication date: 9 February 2018

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-017-0562-5

zbMATH Keywords

mixed integer programmingcutting plane methodseparation algorithmcoefficient strengthening

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Uses Software

• SCIP
• SoPlex
• MIPLIB
• CPLEX
• MIPLIB2003

Cites Work

• Unnamed Item
• The convex hull of two core capacitated network design problems
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
• Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
• Valid inequalities and separation for uncapacitated fixed charge networks
• On the \(0/1\) knapsack polytope
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
• Conflict graphs in solving integer programming problems
• MIPLIB 2003
• Conflict analysis in mixed integer programming
• Presolve Reductions in Mixed Integer Programming
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Solving Large-Scale Zero-One Linear Programming Problems
• Valid Linear Inequalities for Fixed Charge Problems
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• Disjunctive Programming
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Mixed Integer Programming: Analyzing 12 Years of Progress