Relaxations of mixed integer sets from lattice-free polyhedra.
Alberto Del PiaRobert WeismantelPublished in: 4OR (2012)
Keyphrases
- mixed integer
- convex hull
- totally unimodular
- linear program
- feasible solution
- linear programming
- mixed integer programming
- extreme points
- facility location
- lot sizing
- convex sets
- optimal solution
- cutting plane
- benders decomposition
- continuous relaxation
- valid inequalities
- continuous variables
- lagrangian heuristic
- network design problem
- mixed integer program
- np hard
- lower bound
- search algorithm
- genetic algorithm