On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem.
Jeroen BeliënErik DemeulemeesterPublished in: Ann. Oper. Res. (2007)
Keyphrases
- column generation
- trade off
- scheduling problem
- branch and bound
- linear program
- linear programming
- mixed integer programming
- cutting plane
- exact solution
- vehicle routing
- integer program
- integer programming
- integer linear programming
- set partitioning
- flowshop
- single machine
- lagrangean relaxation
- set covering
- optimal solution
- lagrangian relaxation
- constraint programming
- np hard
- lower bound
- tabu search
- linear programming problems
- upper bound