Valid inequalities based on simple mixed-integer sets.
Sanjeeb DashOktay GünlükPublished in: Math. Program. (2006)
Keyphrases
- mixed integer
- valid inequalities
- mixed integer programming
- linear program
- cutting plane
- network design problem
- feasible solution
- lot sizing
- cutting plane algorithm
- linear programming
- convex hull
- mixed integer program
- integer programming
- optimal solution
- traveling salesman problem
- facet defining inequalities
- continuous variables
- column generation
- network flow problem
- lower and upper bounds
- continuous relaxation
- genetic algorithm
- graphical models
- objective function
- training data