Metric inequalities for routings on direct connections with application to line planning

DOI10.1016/j.disopt.2015.07.004zbMath1387.90060OpenAlexW1502173067MaRDI QIDQ1751129

Marika Karbstein, Ralf Borndörfer

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2015.07.004

zbMATH Keywords

integer programmingcombinatorial optimizationtransfersmetric inequalitiesline planningdirect connection

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Uses Software

• SCIP
• GAMS
• lop.gms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• SCIP: solving constraint integer programs
• Optimal lines for railway systems
• Discrete optimization in public rail transport
• Simultaneous Network Line Planning and Traffic Assignment.
• Line Planning with Minimal Traveling Time
• A Direct Connection Approach to Integrated Line Planning and Passenger Routing
• Planning Problems in Public Transit

This page was built for publication: Metric inequalities for routings on direct connections with application to line planning