Note on the complexity of the mixed-integer hull of a polyhedron.
Robert HildebrandTimm OertelRobert WeismantelPublished in: Oper. Res. Lett. (2015)
Keyphrases
- mixed integer
- convex hull
- mixed integer programming
- benders decomposition
- cutting plane
- feasible solution
- continuous relaxation
- network design problem
- extreme points
- mixed integer program
- lagrangian heuristic
- lot sizing
- valid inequalities
- computational complexity
- quadratic program
- data points
- continuous variables
- linear program
- training samples
- simulated annealing
- np hard
- lower bound
- totally unimodular
- optimal solution