Experimental and Efficient Algorithms

DOI10.1007/B136461MaRDI QIDQ5710035zbMATH OpenOpenAlexFDO

Authors Christian Liebchen

Publication date 30 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136461

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A matching approach for periodic timetabling
• Periodic railway timetabling with event flexibility
• The second Chvátal closure can yield better railway timetables
• Improving the modulo simplex algorithm for large-scale periodic timetabling
• Periodic metro scheduling

Cited in

(5)

• Integral cycle bases for cyclic timetabling
• The second Chvátal closure can yield better railway timetables
• Periodic metro scheduling
• Automatic scheduling of periodic event networks by SAT solving
• A phase I simplex method for finding feasible periodic timetables

This page was built for publication: Experimental and Efficient Algorithms

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