We consider the problem of planning the annual timetable for all freight trains in Germany simultaneously. That is, for each train, construct a slot through the network such that no two slots of different trains have a conflict. We denote this task by the Train Path Assignment Problem (TPAP) and con...
|Place of publication:||
|Data of publication:||2020|
|Online Access:||available in Bonn?|
|Database:||Dokumentenserver der FU Berlin
Database information Databases - DBIS