Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations.
Robert HildebrandRobert WeismantelRico ZenklusenPublished in: SODA (2017)
Keyphrases
- mixed integer
- lower bound
- valid inequalities
- mixed integer linear programming
- cutting plane
- optimal solution
- branch and bound algorithm
- feasible solution
- linear program
- lagrangian heuristic
- branch and bound
- convex hull
- objective function
- upper bound
- lower and upper bounds
- linear programming relaxation
- mixed integer programming
- worst case
- network design problem
- continuous relaxation
- benders decomposition
- continuous variables
- linear programming
- lot sizing
- lagrangian relaxation
- quadratic program
- computational complexity
- sample size
- mixed integer program