Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting

zbMath1410.90131arXiv1712.02176MaRDI QIDQ4607933

Rico Zenklusen, Stefan Weltge, Alfonso Cevallos

Publication date: 15 March 2018

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

zbMATH Keywords

extended formulationsextension complexitymixed-integer programs

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (8)

Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles ⋮ Lattice-free simplices with lattice width \(2d - o(d)\) ⋮ Lattice closures of polyhedra ⋮ Efficient MIP techniques for computing the relaxation complexity ⋮ Computational aspects of relaxation complexity: possibilities and limitations ⋮ Extended formulations for radial cones ⋮ The integrality number of an integer program ⋮ Extended formulations for stable set polytopes of graphs without two disjoint odd cycles

This page was built for publication: Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting