Railway Timetabling Using Lagrangian Relaxation.
Ulf BrännlundPer Olov LindbergAndreas NõuJan-Eric NilssonPublished in: Transp. Sci. (1998)
Keyphrases
- lagrangian relaxation
- integer programming
- constraint programming
- column generation
- branch and bound algorithm
- lower bound
- feasible solution
- np hard
- lower and upper bounds
- timetabling problem
- dual decomposition
- linear programming
- dynamic programming
- network design problem
- capacity constraints
- mixed integer program
- mixed integer programming
- relaxation algorithm
- valid inequalities
- lagrangian heuristic
- shortest path
- constraint satisfaction problems
- single machine scheduling problem
- constraint satisfaction
- reinforcement learning
- cutting plane
- mixed integer
- branch and bound
- scheduling problem
- neural network