A Branch-and-Cut Approach for Solving Railway Line-Planning Problems

References

• ABACUSABACUS, A Branch-And-CUt System (1998) (Universität zu Köln, Universität Heidelberg, Germany) Google Scholar
• Bussieck M. R. Optimal lines in public rail transport. (1998) (University of Braunschweig, Braunschweig, Germany) . Ph.D. thesisGoogle Scholar
• Bussieck M. R., Kreuzer P., Zimmermann U. T. Optimal lines for railway systems. Eur. J. Oper. Res. (1996) 96(1):54–63Crossref, Google Scholar
• Bussieck M. R., Lindner T., Lübbecke M. E. Cost optimal line planning: A combined linear/nonlinear integer programming approach. (2002) . Technical report, Department of Mathematical Optimization, Braunschweig University of Technology, Braunschweig, GermanyGoogle Scholar
• Caprara A., Fischetti M., Toth P., Vigo D., Guida P. L. Algorithms for railway crew management. Math. Programming (1997) 79:125–141Crossref, Google Scholar
• Claessens M. T., van Dijk N. M., Zwaneveld P. J. Cost optimal allocation of rail passenger lines. Eur. J. Oper. Res. (1998) 110:474–489Crossref, Google Scholar
• Dietrich B. L., Escudero L. F. Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts. Eur. J. Oper. Res. (1994) 73:539–546Crossref, Google Scholar
• Gallo G., Di Miele F. Dispatching busses in parking depots. Transportation Sci. (2001) 79:322–330Link, Google Scholar
• Goossens J. H. M., van Hoesel C. P. M., Kroon L. G. On solving multi-type line planning problems. (2002) . METEOR Research Memorandum RM/02/009, University of Maastricht, Maastricht, The NetherlandsGoogle Scholar
• Härte F. L. Het verbeteren van dienstregelingen en het opstellen van lijnvoeringen. (1995) (Free University Amsterdam, Amsterdam, The Netherlands (in Dutch)) . Master's thesisGoogle Scholar
• Linderoth J. T., Savelsbergh M. W. P. A computational study of search strategies for mixed integer programming. INFORMS J. Comput. (1999) 11(2):173–187Link, Google Scholar
• Lindner T. Train schedule optimization in public rail transport. (2000) (Braunschweig University of Technology, Braunschweig, Germany) . Ph.D. thesisGoogle Scholar
• Martello S., Toth P.Knapsack Problems: Algorithms and Computer Implementations (1990) (John Wiley and Sons, New York) Google Scholar
• Nachtigall K. Periodic network optimization and fixed interval timetables. (1999) (Deutsches Zentrum für Luft- und Raumfahrt, Braunschweig, Germany) . Ph.D. thesisGoogle Scholar
• Odijk M. A. Railway timetable generation. (1997) (Delft University of Technology, Delft, The Netherlands) . Ph.D. thesisGoogle Scholar
• Oltrogge C. Liniënplanung für mehrstufige Bedienungssysteme im öffentlichen Personenverkehr. (1994) (Technical University of Braunschweig, Braunschweig, Germany (in German)) . Ph.D. thesisGoogle Scholar
• Schrijver A. Minimum circulation of railway stock. CWI Quart. (1993) 3:205–217Google Scholar
• Schrijver A., Steenbeek A. Dienstregelingontwikkeling voor Railned (timetable construction for Railned). (1994) . Technical report, CWI, Center for Mathematics and Computer Science, Amsterdam, The Netherlands (in Dutch)Google Scholar
• Thienel S. ABACUS, A Branch-And-CUt System. (1995) (Universität zu Köln, Köln, Germany) . Ph.D. thesisGoogle Scholar
• Zwaneveld P. J. Railway planning, routing of trains and allocation of passenger lines. (1997) (Erasmus Universiteit Rotterdam, Rotterdam, The Netherlands) . Ph.D. thesisGoogle Scholar