{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:36Z","timestamp":1761611136470,"version":"build-2065373602"},"reference-count":8,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4076,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s1571-0661(04)80529-2","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"53-65","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["Management of Railroad Impedances for Shortest Path-based Routing"],"prefix":"10.1016","volume":"66","author":[{"given":"Jeff","family":"Day","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joel S.","family":"Sokol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80529-2_NEWBIB1","unstructured":"Ahuja, R. K., and J. B. Orlin, Inverse multicommodity flow problem, Working Paper (1998)."},{"key":"10.1016\/S1571-0661(04)80529-2_NEWBIB2","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1287\/opre.49.5.771.10607","article-title":"Inverse optimization","volume":"49","author":"Ahuja","year":"2001","journal-title":"Operations Research"},{"key":"10.1016\/S1571-0661(04)80529-2_NEWBIB3","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/trsc.27.2.102","article-title":"A network-based primal-dual heuristic for the solution of multicommodity network flow problems","volume":"27","author":"Barnhart","year":"1993","journal-title":"Transportation Science"},{"key":"10.1016\/S1571-0661(04)80529-2_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Day J., \u201cManagement of Railroad Impedances for Shortest Path-based Routing,\u201d Ph.D. thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, 2002.","DOI":"10.1016\/S1571-0661(04)80529-2"},{"key":"10.1016\/S1571-0661(04)80529-2_NEWBIB5","unstructured":"Farag\u00f3, A., \u00c1. Szentesi, and B. Szviatovszki, Inverse shortest path algorithms in high speed networks Working Paper (1999)."},{"key":"10.1016\/S1571-0661(04)80529-2_NEWBIB6","unstructured":"Wikum, E. D., A mathematical programming-based procedure for calibrating a shortest path-based blocking network, Norfolk Southern Corporation (1996)."},{"key":"10.1016\/S1571-0661(04)80529-2_NEWBIB7","first-page":"347","article-title":"A column generation method for inverse shortest path problem","volume":"41","author":"Zhang","year":"1995","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"10.1016\/S1571-0661(04)80529-2_NEWBIB8","unstructured":"Zhang J., and C. Yang, A node-controlled inverse shortest paths problem, University of Hong Kong (1998)."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805292?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805292?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:27Z","timestamp":1761609927000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S1571066104805292"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80529-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Management of Railroad Impedances for Shortest Path-based Routing","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80529-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}