Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations

DOI10.1137/1.9781611974782.154zbMath1422.90028arXiv1611.00707OpenAlexW2952946010MaRDI QIDQ4575902

Robert Hildebrand, Robert Weismantel, Rico Zenklusen

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (4)

Binary extended formulations of polyhedral mixed-integer sets ⋮ Lattice closures of polyhedra ⋮ Balas formulation for the union of polytopes is optimal ⋮ The integrality number of an integer program

This page was built for publication: Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations