Complexity, bounds and dynamic programming algorithms for single track train scheduling

Complexity, bounds and dynamic programming algorithms for single track train scheduling

Harbering, Jonas ; Ranade, Abhiram ; Schmidt, Marie ; Sinnen, Oliver
Identifier: http://hdl.handle.net/2292/42307
Reference: Annals of Operations Research 273(1-2) 479-500 Feb 2019
Rights: Copyright: Springer Verlag
Rights (URI): https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm
Rights (URI): https://www.springer.com/gp/open-access/authors-rights/self-archiving-policy/2124

Show full item record

Files in this item

Icon
Size: 243.4Kb
Format: PDF
Description: Accepted version
Icon
DOI: 10.1007/s10479-017-2644-7
Find Full text

This item appears in the following Collection(s)

Share

Search ResearchSpace


Browse

Statistics