Models and algorithms for combinatorial optimization problems arising in railway applications

DOI10.1007/s10288-008-0075-7zbMath1162.90330OpenAlexW1964148745MaRDI QIDQ1022444

Valentina Cacchiani

Publication date: 22 June 2009

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: http://amsdottorato.unibo.it/344/1/Tesi_Cacchiani.pdf

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Local convex hulls for a special class of integer multicommodity flow problems ⋮ Optimizing the simplon railway corridor

Cites Work

• A column generation approach to train timetabling on a corridor
• A Survey of Optimization Models for Train Routing and Scheduling
• Solving a Real-World Train Unit Assignment Problem
• Modeling and Solving the Train Timetabling Problem

This page was built for publication: Models and algorithms for combinatorial optimization problems arising in railway applications