On obtaining the 'best' multipliers for a lagrangean relaxation for integer programming.
Bezalel GavishPublished in: Comput. Oper. Res. (1978)
Keyphrases
- integer programming
- lagrangean relaxation
- column generation
- lagrangian relaxation
- linear programming relaxation
- linear programming
- set covering problem
- constraint programming
- cutting plane
- np hard
- integer program
- valid inequalities
- ai planning
- set covering
- mixed integer programming
- network flow
- production planning
- vehicle routing problem with time windows
- cutting plane algorithm
- set partitioning
- inference problems
- special case
- dynamic programming