Integral cycle bases for cyclic timetabling
From MaRDI portal
Recommendations
- Finding short integral cycle bases for cyclic timetabling
- Forward and line-based cycle bases for periodic timetabling
- Separation of cycle inequalities in periodic timetabling
- Separation of cycle inequalities for the periodic timetabling problem
- Publication:3478256
- A robust basic cyclic scheduling problem
- The cyclical scheduling problem
- The cyclical scheduling problem
- The basic cyclic scheduling problem with deadlines
- Cycle-based facets of chromatic scheduling polytopes
Cites work
- scientific article; zbMATH DE number 2089223 (Why is no real title available?)
- scientific article; zbMATH DE number 5343212 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1145916 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 2042677 (Why is no real title available?)
- A Mathematical Model for Periodic Scheduling Problems
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- A greedy approach to compute a minimum cycle basis of a directed graph
- Algorithms for Generating Fundamental Cycles in a Graph
- Automata, Languages and Programming
- Benchmarks for Strictly Fundamental Cycle Bases
- Classes of cycle bases
- Experimental and Efficient Algorithms
- Finding short integral cycle bases for cyclic timetabling
- Integral cycle bases for cyclic timetabling
- Is every cycle basis fundamental?
- Lower-Stretch Spanning Trees
- Minimum cycle bases for network graphs
- Minimum cycle bases, faster and simpler
- Minimum weakly fundamental cycle bases are hard to find
- Network flows. Theory, algorithms, and applications.
- On finding a cycle basis with a shortest maximal cycle
- Performance of algorithms for periodic timetable optimization
- Periodic network optimization with different arc frequencies
Cited in
(22)- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Periodic railway timetabling with event flexibility
- On the approximability of the minimum strictly fundamental cycle basis problem
- Forward cycle bases and periodic timetabling
- How to minimize cycle times of robot manufacturing systems
- Railway timetabling with integrated passenger distribution
- Periodic event scheduling for automated production systems
- An iterative heuristic for passenger-centric train timetabling with integrated adaption times
- Forward and line-based cycle bases for periodic timetabling
- Disjoint congruence classes and a timetabling application
- An experimental comparison of periodic timetabling models
- Classes of cycle bases
- 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
- Separation of cycle inequalities in periodic timetabling
- A short-turning policy for the management of demand disruptions in rapid transit systems
- Exact formulations and algorithm for the train timetabling problem with dynamic demand
- Finding short integral cycle bases for cyclic timetabling
This page was built for publication: 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 Q1013300)
