Multiple Depot Vehicle Scheduling Problem: A New Heuristic Based on Quasi-Assignment Algorithms
- 1 January 1992
- book chapter
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- A branch and bound algorithm for the multiple depot vehicle scheduling problemNetworks, 1989
- An Additive Bounding Procedure for Combinatorial Optimization ProblemsOperations Research, 1989
- A new dominance procedure for combinatorial optimization problemsOperations Research Letters, 1988
- On some matching problems arising in vehicle scheduling modelsNetworks, 1987
- A quasi‐assignment algorithm for bus schedulingNetworks, 1987
- Validation of subgradient optimizationMathematical Programming, 1974