Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation

Caprara, Alberto

doi:10.4230/OASIcs.ATMOS.2010.1

Document

Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation

Author Alberto Caprara

Part of: Volume: 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10) (ATMOS 2010)
Part of: Series: Open Access Series in Informatics (OASIcs)
Part of: Conference: Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2010-09-01

PDF

File

PDF

OASIcs.ATMOS.2010.1.pdf

Filesize: 330 kB
12 pages

Document Identifiers

DOI: 10.4230/OASIcs.ATMOS.2010.1
URN: urn:nbn:de:0030-drops-27452

Subject Classification

Keywords

Railway Planning
Integer Multicommodity Flow
Integer Linear Programming Formulations
Lagrangian Relaxation
Column Generation

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get BibTex

Alberto Caprara. Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010) https://doi.org/10.4230/OASIcs.ATMOS.2010.1

Author Details

Alberto Caprara

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail