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

Show simple item record

dc.contributor.author Harbering, Jonas en
dc.contributor.author Ranade, Abhiram en
dc.contributor.author Schmidt, Marie en
dc.contributor.author Sinnen, Oliver en
dc.date.accessioned 2018-10-17T00:34:22Z en
dc.identifier.citation Annals of Operations Research 273(1-2) 479-500 Feb 2019 en
dc.identifier.issn 0254-5330 en
dc.identifier.uri http://hdl.handle.net/2292/42307 en
dc.relation.ispartofseries Annals of Operations Research en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. Details obtained from http://www.sherpa.ac.uk/romeo/issn/0254-5330/ en
dc.rights This is a post-peer-review, pre-copyedit version of an article published in Annals of Operations Research. The final authenticated version is available online at: http://dx.doi.org/10.1007/s10479-017-2644-7 en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.rights.uri https://www.springer.com/gp/open-access/authors-rights/self-archiving-policy/2124 en
dc.title Complexity, bounds and dynamic programming algorithms for single track train scheduling en
dc.type Journal Article en
dc.identifier.doi 10.1007/s10479-017-2644-7 en
dc.rights.holder Copyright: Springer Verlag en
pubs.publication-status Published online en
dc.rights.accessrights http://purl.org/eprint/accessRights/OpenAccess en
pubs.elements-id 697651 en
pubs.org-id Engineering en
pubs.org-id Department of Electrical, Computer and Software Engineering en
dc.identifier.eissn 1572-9338 en
pubs.online-publication-date 2017-10-07 en


Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Browse

Statistics