{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:16Z","timestamp":1759847536151},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742456"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74247-0_14","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T02:33:12Z","timestamp":1189737192000},"page":"264-275","source":"Crossref","is-referenced-by-count":5,"title":["The Railway Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Georgia","family":"Hadjicharalambous","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petrica","family":"Pop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelia","family":"Pyrga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Tsaggouris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Zaroliagis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"Network Flows","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"14_CR2","volume-title":"The Traveling Salesman Problem and its Variations","author":"M. Fischetti","year":"2002","unstructured":"Fischetti, M., Salazar-Gonzalez, J., Toth, P.: The Generalized Traveling Salesman Problem and Orienteering Problem. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and its Variations, Kluwer, Dordrecht (2002)"},{"key":"14_CR3","volume-title":"Handbook of Graph Theory","author":"G. Gutin","year":"2003","unstructured":"Gutin, G.: Traveling Salesman and Related Problems. In: Gross, J., Yellen, J. (eds.) Handbook of Graph Theory, CRC Press, Boca Raton (2003)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1287\/opre.39.4.623","volume":"39","author":"C. Noon","year":"1991","unstructured":"Noon, C., Bean, J.: A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem. Operations Research\u00a039, 623\u2013632 (1991)","journal-title":"Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Schulz, F., Wagner, D., Weihe, K.: Dijkstra\u2019s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. ACM Journal of Experimental Algorithmics\u00a05(12) (2000)","key":"14_CR5","DOI":"10.1145\/351827.384254"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Methods for Railway Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74247-0_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:15:36Z","timestamp":1619518536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74247-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540742456"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74247-0_14","relation":{},"subject":[]}}