{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T17:20:00Z","timestamp":1773681600212,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T00:00:00Z","timestamp":1416441600000},"content-version":"vor","delay-in-days":4859,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s1571-0661(04)00162-8","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T10:14:39Z","timestamp":1075371279000},"page":"13-23","source":"Crossref","is-referenced-by-count":39,"title":["Locating New Stops in a Railway Network1 1This work was partially supported by the Human Potential Programme of the European Union under contract no. HPRN-CT-1999-00104 (AMORE)."],"prefix":"10.1016","volume":"50","author":[{"given":"Horst W.","family":"Hamacher","sequence":"first","affiliation":[]},{"given":"Annegret","family":"Liebers","sequence":"additional","affiliation":[]},{"given":"Anita","family":"Sch\u00f6bel","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00162-8_NEWBIB1","series-title":"\u201cLocation Theory: Applications and Theory\u201d","year":"2001"},{"key":"10.1016\/S1571-0661(04)00162-8_NEWBIB2","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/trsc.6.4.379","article-title":"Geometrical solutions for some minimax location problems","volume":"6","author":"Elzinga","year":"1972","journal-title":"Transportation Science"},{"key":"10.1016\/S1571-0661(04)00162-8_NEWBIB3","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0196-6774(82)90018-9","article-title":"The NP-Completeness Column: An Ongoing Guide","volume":"3","author":"Johnson","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/S1571-0661(04)00162-8_NEWBIB4","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","article-title":"Linear time algorithms for linear programming in IR3 and related problems","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM J. on Computing"},{"key":"10.1016\/S1571-0661(04)00162-8_NEWBIB5","series-title":"Modern Heuristic Techniques for Combinatorial Problems","first-page":"151","article-title":"Genetic Algorithms","author":"Reeves","year":"1995"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001628?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001628?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T09:53:59Z","timestamp":1550224439000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104001628"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S1571066104001628"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00162-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}