Technical Note - Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks.
Fred W. GloverJohn M. MulveyPublished in: Oper. Res. (1980)
Keyphrases
- integer programming
- linear programming
- constraint programming
- ai planning
- cutting plane algorithm
- lagrangian relaxation
- network flow
- facility location
- np hard
- integer program
- production planning
- set covering problem
- network model
- column generation
- transportation problem
- inference problems
- set covering
- cutting plane
- round robin tournament
- linear programming relaxation
- valid inequalities
- set partitioning
- finite number
- dantzig wolfe decomposition