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

Author Alberto Caprara



PDF
Thumbnail PDF

File

OASIcs.ATMOS.2010.1.pdf
  • Filesize: 330 kB
  • 12 pages

Document Identifiers

Author Details

Alberto Caprara

Cite AsGet 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

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.
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
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail