Strong formulations for the multi-module PESP and a quadratic algorithm for graphical Diophantine equation systems

DOI10.1007/978-3-642-15775-2_29MaRDI QIDQ3586475zbMATH OpenOpenAlexFDO

Authors Laura Galli, Sebastian Stiller

Publication date 6 September 2010

Published in Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL https://depositonce.tu-berlin.de/handle/11303/15696

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Recommendations

• Improving the modulo simplex algorithm for large-scale periodic timetabling
• A matching approach for periodic timetabling
• scientific article; zbMATH DE number 5343212
• Forward and line-based cycle bases for periodic timetabling
• Periodic railway timetabling with event flexibility

Cited in

(3)

• PESP
• An experimental comparison of periodic timetabling models
• Improving the modulo simplex algorithm for large-scale periodic timetabling

This page was built for publication: Strong formulations for the multi-module PESP and a quadratic algorithm for graphical Diophantine equation systems

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