Railway scheduling by network optimization

DOI10.1016/0895-7177(91)90014-XzbMath0716.90057OpenAlexW1973262721MaRDI QIDQ753674

Alistair I. Mees

Publication date: 1991

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(91)90014-x

zbMATH Keywords

network optimizationapproximate algorithmrailway scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

Exact train pathing ⋮ Continuous-time shortest path problems with stopping and starting costs ⋮ A finite-time algorithm for shortest path problems with time-varying costs ⋮ Optimal control on a graph with application to train scheduling problems ⋮ A fast heuristic for the train scheduling problem

Cites Work

• New methods for multi-commodity flows
• Combinatorial approaches to multiflow problems
• Dioïds and semirings: Links to fuzzy sets and other applications
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Railway scheduling by network optimization