Solving Nurse Scheduling Problem by Integer-Programming-Based Local Search.
Seiya HasegawaYukio KosugiPublished in: SMC (2006)
Keyphrases
- integer programming
- scheduling problem
- np hard
- tabu search
- integer program
- optimal solution
- job shop scheduling problem
- combinatorial optimization
- lp relaxation
- linear programming
- single machine
- constraint programming
- search heuristics
- column generation
- set partitioning
- ai planning
- search algorithm
- cutting plane
- flowshop
- network flow
- memetic algorithm
- production planning
- set covering
- health care
- lagrangian relaxation
- np complete
- set covering problem
- feasible solution
- genetic algorithm
- inference problems
- cutting plane algorithm
- exact methods
- approximation algorithms
- valid inequalities
- special case
- stochastic local search
- linear program
- vehicle routing problem with time windows
- facility location
- search space
- timetabling problem
- minimum cost
- dynamic programming
- simulated annealing
- branch and bound algorithm
- families of valid inequalities