Computing deep facet-defining disjunctive cuts for mixed-integer programming.
Florent CadouxPublished in: Math. Program. (2010)
Keyphrases
- mixed integer programming
- valid inequalities
- facet defining
- mixed integer
- column generation
- lot sizing
- production planning
- facet defining inequalities
- lagrangian relaxation
- classes of valid inequalities
- integer programming
- lower and upper bounds
- cutting plane
- convex hull
- particle swarm optimization
- linear programming
- special case