Separation of cycle inequalities in periodic timetabling
DOI10.1016/J.DISOPT.2019.100552zbMATH Open1474.90136OpenAlexW2950315005MaRDI QIDQ2299981FDOQ2299981
Authors: Ralf Borndörfer, Heide Hoppmann, Marika Karbstein, Niels Lindner 
Publication date: 24 February 2020
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2019.100552
Recommendations
- Separation of cycle inequalities for the periodic timetabling problem
- Forward and line-based cycle bases for periodic timetabling
- Separating clique tree and bipartition inequalities in polynomial time
- Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time
- The second Chvátal closure can yield better railway timetables
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)
Cites Work
- A Mathematical Model for Periodic Scheduling Problems
- Title not available (Why is that?)
- Periodic Timetable Optimization in Public Transport
- Title not available (Why is that?)
- Integral cycle bases for cyclic timetabling
- Solving periodic timetable optimisation problems by modulo simplex calculations
- The second Chvátal closure can yield better railway timetables
Cited In (6)
- Determining all integer vertices of the PESP polytope by flipping arcs
- Periodic event scheduling for automated production systems
- Forward and line-based cycle bases for periodic timetabling
- Introducing TimPassLib -- a library for integrated periodic timetabling and passenger routing
- Separation of cycle inequalities for the periodic timetabling problem
- Integral cycle bases for cyclic timetabling
Uses Software
This page was built for publication: Separation of cycle inequalities in periodic timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299981)
