Finding Descriptions of Polytopes via Extended Formulations and Liftings

zbMath1263.90076arXiv1109.0815MaRDI QIDQ3109936

Volker Kaibel, Andreas Loos

Publication date: 26 January 2012

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

zbMATH Keywords

polytopeslinear descriptionsorbisacks

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (5)

Ideal, non-extended formulations for disjunctive constraints admitting a network representation ⋮ Lexicographical order in integer programming ⋮ On the extension complexity of polytopes separating subsets of the Boolean cube ⋮ Strong IP formulations need large coefficients ⋮ Strong cuts from compatibility relations for the dial-a-ride problem

This page was built for publication: Finding Descriptions of Polytopes via Extended Formulations and Liftings