Two row mixed-integer cuts via lifting.
Santanu S. DeyLaurence A. WolseyPublished in: Math. Program. (2010)
Keyphrases
- mixed integer
- facet defining
- valid inequalities
- facet defining inequalities
- linear program
- mixed integer programming
- benders decomposition
- convex hull
- lot sizing
- feasible solution
- continuous relaxation
- network design problem
- mixed integer program
- optimal solution
- cutting plane
- quadratic program
- linear programming
- lagrangian relaxation
- training data
- lagrangian heuristic