A geometric way to build strong mixed-integer programming formulations

DOI10.1016/j.orl.2019.10.003zbMath1476.90209arXiv1811.10409MaRDI QIDQ2294389

Juan Pablo Vielma, Joey Huchette

Publication date: 10 February 2020

Published in: Operations Research Letters (Search for Journal in Brave)

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

zbMATH Keywords

mixed-integer programming; disjunctive constraints; formulations

Mathematics Subject Classification ID

52B12: Special polytopes (linear programming, centrally symmetric, etc.)

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut