Technical Note - Stronger Inequalities for 0-1 Integer Programming: Computational Refinements.
Ferydoon KianfarPublished in: Oper. Res. (1976)
Keyphrases
- integer programming
- cutting plane
- valid inequalities
- cutting plane algorithm
- integer programming formulations
- linear programming
- np hard
- constraint programming
- lagrangian relaxation
- set covering problem
- set covering
- inference problems
- ai planning
- linear programming relaxation
- vehicle routing problem with time windows
- network flow
- network design problem
- column generation
- families of valid inequalities
- lp relaxation
- transportation problem
- facility location
- mixed integer
- production planning
- exact methods
- np complete
- facet defining inequalities
- facet defining
- sufficient conditions