Valid inequalities for mixed integer linear programs.
Gérard CornuéjolsPublished in: Math. Program. (2008)
Keyphrases
- mixed integer linear programs
- valid inequalities
- integer programming
- traveling salesman problem
- linear programming
- cutting plane algorithm
- mixed integer programming
- mixed integer
- cutting plane
- convex hull
- feasible solution
- column generation
- network design problem
- lower and upper bounds
- primal dual
- lagrangian relaxation
- vehicle routing problem with time windows
- integer program
- continuous relaxation
- linear program
- learning algorithm
- continuous variables
- vehicle routing problem
- convex optimization
- upper bound
- objective function