Relaxations of mixed integer sets from lattice-free polyhedra.
Alberto Del PiaRobert WeismantelPublished in: Ann. Oper. Res. (2016)
Keyphrases
- mixed integer
- convex hull
- totally unimodular
- linear program
- extreme points
- feasible solution
- benders decomposition
- lot sizing
- mixed integer programming
- linear programming
- optimal solution
- cutting plane
- facility location
- convex sets
- lower bound
- special case
- valid inequalities
- network design problem
- continuous relaxation
- geometric properties
- np hard
- lagrangian heuristic
- continuous variables
- quadratic program
- mixed integer program
- probability distribution