Algorithms for railway crew management
- 1 October 1997
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 79 (1), 125-141
- https://doi.org/10.1007/bf02614314
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set CoveringOperations Research, 1996
- A genetic algorithm for the set covering problemEuropean Journal of Operational Research, 1996
- A heuristic procedure for the crew rostering problemEuropean Journal of Operational Research, 1992
- Enhancing an algorithm for set covering problemsEuropean Journal of Operational Research, 1992
- A lagrangian heuristic for set-covering problemsNaval Research Logistics (NRL), 1990
- A network model for the rotating workforce scheduling problemNetworks, 1990
- An algorithm for set covering problemEuropean Journal of Operational Research, 1987
- Network models for vehicle and crew schedulingEuropean Journal of Operational Research, 1984
- Routing and scheduling of vehicles and crewsComputers & Operations Research, 1983
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational studyPublished by Springer Nature ,1980