Variable neighborhood search accelerated column generation for the nurse rostering problem.
Rafael A. M. GomesTúlio A. M. ToffoloHaroldo Gambini SantosPublished in: Electron. Notes Discret. Math. (2017)
Keyphrases
- column generation
- variable neighborhood search
- metaheuristic
- constraint programming
- branch and bound
- tabu search
- optimal solution
- traveling salesman problem
- linear programming
- single machine scheduling problem
- heuristic methods
- lagrangian relaxation
- linear program
- integer programming
- routing problem
- hybrid method
- combinatorial optimization
- mixed integer programming
- integer program
- cutting plane
- search space
- minimum spanning tree
- path relinking
- exact solution
- vehicle routing problem
- benchmark instances
- set partitioning
- set covering problem
- constraint satisfaction problems
- search procedure
- search algorithm
- branch and bound algorithm
- set covering
- combinatorial problems
- upper bound
- combinatorial optimization problems
- optimization problems
- np hard
- computational complexity
- lower bound
- genetic algorithm
- evolutionary algorithm
- special case
- computational efficiency
- knapsack problem
- solution quality