Face dimensions of general-purpose cutting planes for mixed-integer linear programs

DOI10.1007/978-3-030-73879-2_28zbMath1483.90087arXiv2011.06076OpenAlexW3160270652MaRDI QIDQ2061900

Matthias Walter

Publication date: 21 December 2021

Full work available at URL: https://arxiv.org/abs/2011.06076

zbMATH Keywords

dimensions of faces, state-of-the-art solver

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites Work

• Unnamed Item
• 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
• Geometric algorithms and combinatorial optimization.
• On the \(0/1\) knapsack polytope
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Aggregation and Mixed Integer Rounding to Solve MIPs

This page was built for publication: Face dimensions of general-purpose cutting planes for mixed-integer linear programs