A Modulo Network Simplex Method for Solving Periodic Timetable Optimisation Problems

DOI10.1007/978-3-540-77903-2_71MaRDI QIDQ5391965zbMATH OpenOpenAlexFDO

Authors Karl Nachtigall, Jens Opitz

Publication date 7 April 2011

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77903-2_71

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• A Mathematical Model for Periodic Scheduling Problems
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• Periodic network optimization with different arc frequencies
• Periodic Timetable Optimization in Public Transport

Cited in

(5)

• Networked timetable stability improvement based on a bilevel optimization programming model
• Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure
• Solution of interval PERT/CPM network problems by a simplified tabular method
• Periodic event scheduling for automated production systems
• The tropical and zonotopal geometry of periodic timetables

This page was built for publication: A Modulo Network Simplex Method for Solving Periodic Timetable Optimisation Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5391965)