Pages that link to "Item:Q2917354"
From MaRDI portal
The following pages link to Towards solving very large scale train timetabling problems by Lagrangian relaxation (Q2917354):
Displaying 12 items.
- Optimizing the simplon railway corridor (Q475174) (← links)
- A column generation approach to train timetabling on a corridor (Q941001) (← links)
- Conflict resolving -- a local search algorithm for solving large scale conflict graphs in freight railway timetabling (Q2030368) (← links)
- Train timetabling for an urban rail transit line using a Lagrangian relaxation approach (Q2281738) (← links)
- A multi-stage IP-based heuristic for class timetabling and trainer rostering (Q2398428) (← links)
- Dynamic graph generation for the shortest path problem in time expanded networks (Q2436645) (← links)
- A Lagrangian heuristic algorithm for a real-world train timetabling problem (Q2489900) (← links)
- Railway timetabling using Lagrangian relaxation (Q2783825) (← links)
- Almost 20 years of combinatorial optimization for railway planning: from Lagrangian relaxation to column generation (Q2917282) (← links)
- Dynamic graph generation and dynamic rolling horizon techniques in large scale train timetabling (Q2917286) (← links)
- Modeling and Solving the Train Timetabling Problem (Q3635144) (← links)
- A Note on the Use of Lagrangean Relaxation in Railway Scheduling (Q4834094) (← links)
