Networks

Cover image for Vol. 57 Issue 1

Special Issue: Optimization in Scheduled Transportation Networks

January 2011

Volume 57, Issue 1

Pages 1–113

    1. Special issue of Networks on optimization in scheduled transportation networks (pages 1–2)

      Ravindra K. Ahuja and Christian Liebchen

      Article first published online: 16 MAR 2010 | DOI: 10.1002/net.20378

    2. Periodic railway timetabling with event flexibility (pages 3–18)

      Gabrio Caimi, Martin Fuchsberger, Marco Laumanns and Kaspar Schüpbach

      Article first published online: 24 MAR 2010 | DOI: 10.1002/net.20379

    3. How to find good night train connections (pages 19–27)

      Thorsten Gunkel, Mathias Schnee and Matthias Müller–Hannemann

      Article first published online: 24 MAR 2010 | DOI: 10.1002/net.20380

    4. A note on the online nature of the railway delay management problem (pages 28–37)

      Natalia Kliewer and Leena Suhl

      Article first published online: 24 MAR 2010 | DOI: 10.1002/net.20381

    5. Experimental study of speed up techniques for timetable information systems (pages 38–52)

      Reinhard Bauer, Daniel Delling and Dorothea Wagner

      Article first published online: 24 MAR 2010 | DOI: 10.1002/net.20382

    6. Modeling and solving a multimodal transportation problem with flexible-time and scheduled services (pages 53–68)

      Luigi Moccia, Jean-François Cordeau, Gilbert Laporte, Stefan Ropke and Maria Pia Valentini

      Article first published online: 29 APR 2010 | DOI: 10.1002/net.20383

    7. A MIP-based local search method for the railway rescheduling problem (pages 69–86)

      Rodrigo Acuna-Agost, Philippe Michelon, Dominique Feillet and Serigne Gueye

      Article first published online: 16 MAR 2010 | DOI: 10.1002/net.20384

    8. Multistage methods for freight train classification (pages 87–105)

      Riko Jacob, Peter Márton, Jens Maue and Marc Nunkesser

      Article first published online: 16 MAR 2010 | DOI: 10.1002/net.20385

    9. Line planning, path constrained network flow and inapproximability (pages 106–113)

      Christina Büsing and Sebastian Stiller

      Article first published online: 16 MAR 2010 | DOI: 10.1002/net.20386

SEARCH

SEARCH BY CITATION