Solving a school bus scheduling problem with integer programming.
Armin FügenschuhPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- integer programming
- scheduling problem
- np hard
- integer program
- lagrangian relaxation
- set partitioning
- linear programming
- column generation
- single machine
- lp relaxation
- tabu search
- set covering
- network flow
- flowshop
- setup times
- np complete
- cutting plane algorithm
- cutting plane
- set covering problem
- ai planning
- production planning
- inference problems
- strongly np hard
- linear relaxation
- optimal solution
- valid inequalities
- facility location
- lower bound
- approximation algorithms
- branch and bound algorithm
- constraint programming
- families of valid inequalities
- round robin tournament
- dantzig wolfe decomposition
- vehicle routing problem with time windows
- transportation problem
- combinatorial optimization
- linear program
- exact methods
- global constraints
- computational complexity