New Solution for a Benchmark Nurse Scheduling Problem Using Integer Programming.
Geetha BaskaranAndrzej BargielaRong QuPublished in: ICITCS (2014)
Keyphrases
- integer programming
- np hard
- scheduling problem
- lagrangian relaxation
- cutting plane
- linear programming
- network flow
- column generation
- ai planning
- valid inequalities
- set partitioning
- production planning
- integer program
- inference problems
- cutting plane algorithm
- facility location
- set covering
- optimal solution
- single machine
- np complete
- minimum cost
- flowshop
- constraint programming
- health care
- set covering problem
- tabu search
- vehicle routing problem with time windows
- crew scheduling
- dantzig wolfe decomposition
- integer programming formulations
- network design problem
- lp relaxation
- branch and bound algorithm
- simulated annealing
- lower bound
- computational complexity