The complexity of the Timetable-Based Railway Network Design Problem.

Nadine Friesen Tim Sander Karl Nachtigall Nils Nießen

Published in: CoRR (2023)

Keyphrases

network design problem
approximation algorithms
network design
benders decomposition
worst case
minimal cost
computational complexity
branch and bound
genetic algorithm
special case
mixed integer programming
transportation networks