A Lagrangian relaxation approach based on a time-space-state network for railway crew scheduling.
Ying WangZheming ZhangDennis HuismanAndrea D'ArianoJinchuan ZhangPublished in: Comput. Ind. Eng. (2022)
Keyphrases
- lagrangian relaxation
- integer programming
- crew scheduling
- network design problem
- search space
- network flow
- lower bound
- lower and upper bounds
- state space
- branch and bound algorithm
- column generation
- network design
- mixed integer programming
- relaxation algorithm
- approximation algorithms
- special case
- convex optimization
- branch and bound
- constraint programming
- dual decomposition
- linear programming