A column generation-based heuristic for rostering with work patterns.
Richard LusbyAnders DohnTroels Martin RangeJesper LarsenPublished in: J. Oper. Res. Soc. (2012)
Keyphrases
- column generation
- lagrangean relaxation
- mixed integer programming
- optimal solution
- lagrangian relaxation
- integer linear programming
- set covering problem
- branch and bound
- set covering
- linear programming
- linear programming relaxation
- linear program
- grasp with path relinking
- hybrid meta heuristic
- vehicle routing
- dantzig wolfe
- constraint programming
- integer programming
- exact solution
- dantzig wolfe decomposition
- integer program
- cutting plane
- linear programming problems
- complete search
- metaheuristic
- search algorithm
- set partitioning
- vehicle routing problem with time windows
- constraint satisfaction
- branch and bound algorithm
- feasible solution
- constraint satisfaction problems
- np hard
- special case
- dual variables
- beam search
- combinatorial optimization
- evolutionary algorithm
- knapsack problem