The complexity of the timetable-based railway network design problem.

Nadine Friesen Tim Sander Christina Büsing Karl Nachtigall Nils Nießen

Published in: Networks (2024)

Keyphrases

network design problem
network design
approximation algorithms
mixed integer
benders decomposition
computational complexity
transportation networks
branch and bound
minimal cost
scheduling problem
linear program
mixed integer programming