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

Alfonso Cevallos Stefan Weltge Rico Zenklusen

Published in: CoRR (2017)

Keyphrases

mixed integer
complexity bounds
totally unimodular
continuous variables
linear program
feasible solution
lot sizing
quadratic program
convex hull
worst case
optimal solution
constraint networks
genetic algorithm
simulated annealing
facet defining inequalities
query containment
feature space
search algorithm