Separation of cycle inequalities in periodic timetabling
From MaRDI portal
Publication:2299981
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)
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
Cites work
- A Mathematical Model for Periodic Scheduling Problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2042677 (Why is no real title available?)
- Integral cycle bases for cyclic timetabling
- Periodic Timetable Optimization in Public Transport
- Solving periodic timetable optimisation problems by modulo simplex calculations
- The second Chvátal closure can yield better railway timetables
Cited in
(8)- Integral cycle bases for cyclic timetabling
- Separation of cycle inequalities for the periodic timetabling problem
- Periodic event scheduling for automated production systems
- Introducing TimPassLib -- a library for integrated periodic timetabling and passenger routing
- Forward and line-based cycle bases for periodic timetabling
- Determining all integer vertices of the PESP polytope by flipping arcs
- On the split closure of the periodic timetabling polytope
- The tropical and zonotopal geometry of periodic timetables
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)