Finding short integral cycle bases for cyclic timetabling
From MaRDI portal
Publication:5897288
DOI10.1007/B13632zbMATH Open1266.90106OpenAlexW1827234103MaRDI QIDQ5897288FDOQ5897288
Authors: Christian Liebchen 
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Recommendations
Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Cited In (22)
- Minimum cycle bases of graphs over different fields
- An improved heuristic for computing short integral cycle bases
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Edge-swapping algorithms for the minimum fundamental cycle basis problem
- Minimum weakly fundamental cycle bases are hard to find
- A characterization of circle graphs in terms of total unimodularity
- Cyclic matrices of weighted digraphs
- Minimum Cycle Bases and Their Applications
- Forward cycle bases and periodic timetabling
- Forward and line-based cycle bases for periodic timetabling
- Integrating Passengers' Routes in Periodic Timetabling: A SAT approach.
- Classes of cycle bases
- An experimental comparison of periodic timetabling models
- Railway track allocation: Models and methods
- A greedy approach to compute a minimum cycle basis of a directed graph
- Properties of Gomory-Hu co-cycle bases
- On a Special Co-cycle Basis of Graphs
- Integral cycle bases for cyclic timetabling
- A combinatorial proof of the removal lemma for groups
- The cycle embedding problem
- Minimizing the waiting time for a one-way shuttle service
- New length bounds for 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)
