Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting.

Alfonso Cevallos Stefan Weltge Rico Zenklusen

Published in: SODA (2018)

Keyphrases

mixed integer
complexity bounds
totally unimodular
linear program
continuous variables
feasible solution
lot sizing
quadratic program
optimal solution
convex hull
worst case
facet defining inequalities
linear programming
objective function
query processing
query containment