Forward and line-based cycle bases for periodic timetabling

DOI10.1007/s43069-023-00229-0zbMath1519.90074OpenAlexW4381735142MaRDI QIDQ6168361

Patricia Ebert, Berenike Masing, Niels Lindner

Publication date: 8 August 2023

Published in: SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s43069-023-00229-0

zbMATH Keywords

cycle spacescycle basesperiodic timetablingperiodic event scheduling problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Cycle bases in graphs characterization, algorithms, complexity, and applications
• Classes of cycle bases
• Integral cycle bases for cyclic timetabling
• Characterization of even directed graphs
• An analysis of the parameterized complexity of periodic timetabling
• Separation of cycle inequalities in periodic timetabling
• A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
• Breaking the O(m 2 n) Barrier for Minimum Cycle Bases
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• A Mathematical Model for Periodic Scheduling Problems
• Circuit bases of strongly connected digraphs
• Periodic Event Scheduling for Automated Production Systems
• Periodic Timetable Optimization in Public Transport

This page was built for publication: Forward and line-based cycle bases for periodic timetabling