Intersection Cuts - A New Type of Cutting Planes for Integer Programming.
Egon BalasPublished in: Oper. Res. (1971)
Keyphrases
- integer programming
- cutting plane
- cutting plane algorithm
- column generation
- integer programming problems
- dantzig wolfe decomposition
- np hard
- linear programming
- integer program
- valid inequalities
- constraint programming
- lagrangian relaxation
- production planning
- linear programming relaxation
- network flow
- lower bound
- scheduling problem
- optimal solution
- set partitioning
- mixed integer
- optimization problems
- lead time
- graphical models
- approximation algorithms
- constraint satisfaction