License: 
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2010.1
URN: urn:nbn:de:0030-drops-27452
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2745/
Caprara, Alberto
Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation
Abstract
We summarize our experience in solving combinatorial optimization
problems arising in railway planning, illustrating all of these
problems as integer multicommodity flow ones and discussing the
main features of the mathematical programming models that were
successfully used in the 1990s and in recent years to solve them.
BibTeX - Entry
@InProceedings{caprara:OASIcs:2010:2745,
author = {Alberto Caprara},
title = {{Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation}},
booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
pages = {1--12},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-939897-20-0},
ISSN = {2190-6807},
year = {2010},
volume = {14},
editor = {Thomas Erlebach and Marco L{\"u}bbecke},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2745},
URN = {urn:nbn:de:0030-drops-27452},
doi = {10.4230/OASIcs.ATMOS.2010.1},
annote = {Keywords: Railway Planning, Integer Multicommodity Flow, Integer Linear Programming Formulations, Lagrangian Relaxation, Column Generation}
}
|
Keywords: |
|
Railway Planning, Integer Multicommodity Flow, Integer Linear Programming Formulations, Lagrangian Relaxation, Column Generation |
|
Collection: |
|
10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10) |
|
Issue Date: |
|
2010 |
|
Date of publication: |
|
01.09.2010 |
