Almost 20 years of combinatorial optimization for railway planning: from Lagrangian relaxation to column generation
DOI10.4230/OASICS.ATMOS.2010.1zbMATH Open1247.90035OpenAlexW1496235754MaRDI QIDQ2917282
Publication date: 28 September 2012
Full work available at URL: https://doi.org/10.4230/OASIcs.ATMOS.2010.1
Lagrangian relaxationcolumn generationinteger multicommodity flowrailway planninginteger linear programming formulations
Mixed integer programming (90C11) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Recommendations
- Combinatorial and robust optimisation models and algorithms for railway applications 👍 👎
- A column generation approach for the rail crew re-scheduling problem 👍 👎
- Models and algorithms for combinatorial optimization problems arising in railway applications 👍 👎
- Train timetabling for an urban rail transit line using a Lagrangian relaxation approach 👍 👎
- Railway timetabling using Lagrangian relaxation 👍 👎
- Towards solving very large scale train timetabling problems by Lagrangian relaxation 👍 👎
- Solving Large Scale Optimization Problems in the Transportation Industry and Beyond Through Column Generation 👍 👎
- A Note on the Use of Lagrangean Relaxation in Railway Scheduling 👍 👎
- A Column-and-Row Generation Algorithm for a Crew Planning Problem in Railways 👍 👎
This page was built for publication: Almost 20 years of combinatorial optimization for railway planning: from Lagrangian relaxation to column generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917282)
