Finding short integral cycle bases for cyclic timetabling
From MaRDI portal
Recommendations
Cited in
(23)- Integral cycle bases for cyclic timetabling
- Edge-swapping algorithms for the minimum fundamental cycle basis problem
- A combinatorial proof of the removal lemma for groups
- Minimum weakly fundamental cycle bases are hard to find
- A greedy approach to compute a minimum cycle basis of a directed graph
- A characterization of circle graphs in terms of total unimodularity
- Minimizing the waiting time for a one-way shuttle service
- New length bounds for cycle bases
- The cycle embedding problem
- An experimental comparison of periodic timetabling models
- Minimum cycle bases of graphs over different fields
- On a Special Co-cycle Basis of Graphs
- Minimum Cycle Bases and Their Applications
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Integrating passengers' routes in periodic timetabling: a SAT approach
- An improved heuristic for computing short integral cycle bases
- Forward and line-based cycle bases for periodic timetabling
- Railway track allocation: Models and methods
- Forward cycle bases and periodic timetabling
- The tropical and zonotopal geometry of periodic timetables
- Properties of Gomory-Hu co-cycle bases
- Cyclic matrices of weighted digraphs
- Classes of cycle bases
This page was built for publication: Finding short integral cycle bases for cyclic timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897288)
