Pages that link to "Item:Q974988"
From MaRDI portal
The following pages link to Non-cyclic train timetabling and comparability graphs (Q974988):
Displaying 14 items.
- An experimental comparison of periodic timetabling models (Q336491) (← links)
- A short-turning policy for the management of demand disruptions in rapid transit systems (Q512986) (← links)
- Non-cyclic train timetabling and comparability graphs (Q974988) (← links)
- A branch and bound algorithm and iterative reordering strategies for inserting additional trains in real time: a case study in Germany (Q1665246) (← links)
- Delay resistant line planning with a view towards passenger transfers (Q1688439) (← links)
- Distance-hereditary comparability graphs (Q1759843) (← links)
- Finding cliques of maximum weight on a generalization of permutation graphs (Q1940437) (← links)
- Conflict resolving -- a local search algorithm for solving large scale conflict graphs in freight railway timetabling (Q2030368) (← links)
- A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing (Q2242251) (← links)
- Exact formulations and algorithm for the train timetabling problem with dynamic demand (Q2257347) (← links)
- A simulated annealing algorithm for first train transfer problem in urban railway networks (Q2285990) (← links)
- Minimizing the waiting time for a one-way shuttle service (Q2305017) (← links)
- Branch-and-bound-based local search heuristics for train timetabling on single-track railway network (Q2358095) (← links)
- Distance-Hereditary Comparability Graphs (Q2840542) (← links)
