Author:
Erlebach Thomas,Gantenbein Martin,Hürlimann Daniel,Neyer Gabriele,Pagourtzis Aris,Penna Paolo,Schlude Konrad,Steinhöfel Kathleen,Taylor David Scot,Widmayer Peter
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Lect Notes Comput Sci;P. Alimonti,1997
2. A. Bertossi, P. Carraresi, and G. Gallo. On some matching problems arising in vehicle scheduling models. Networks, 17:271–281, 1987.
3. P. Brucker, J.L. Hurink, and T. Rolfes. Routing of railway carriages: A case study. Memorandum No. 1498, University of Twente, Fac. of Mathematical Sciences, 1999.
4. M.R. Bussieck, T. Winter, and U.T. Zimmermann. Discrete optimization in public rail transport. Mathematical Programming, 79:415–444, 1997.
5. G. Carpaneto, M. Dell’Amico, M. Fischetti, and P. Toth. A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks, 19:531–548, 1989.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献