{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T06:05:42Z","timestamp":1760853942123},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319557014"},{"type":"electronic","value":"9783319557021"}],"license":[{"start":{"date-parts":[[2017,7,21]],"date-time":"2017-07-21T00:00:00Z","timestamp":1500595200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-55702-1_32","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T14:21:16Z","timestamp":1500560476000},"page":"235-241","source":"Crossref","is-referenced-by-count":4,"title":["Line Planning on Path Networks with Application to the Istanbul Metrob\u00fcs"],"prefix":"10.1007","author":[{"given":"Ralf","family":"Bornd\u00f6rfer","sequence":"first","affiliation":[]},{"given":"Oytun","family":"Arslan","sequence":"additional","affiliation":[]},{"given":"Ziena","family":"Elijazyfer","sequence":"additional","affiliation":[]},{"given":"Hakan","family":"G\u00fcler","sequence":"additional","affiliation":[]},{"given":"Malte","family":"Renken","sequence":"additional","affiliation":[]},{"given":"G\u00fcven\u00e7","family":"\u015eahin","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Schlechte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","unstructured":"Bornd\u00f6rfer, R., Gr\u00f6tschel, M., Jaeger, U.: Planning problems in public transit. Production Factor Mathematics, pp. 95\u2013122 (2010). doi:\n10.1007\/978-3-642-11248-5","DOI":"10.1007\/978-3-642-11248-5"},{"key":"32_CR2","unstructured":"Liebchen, C.: Linien-, Fahrplan-, Umlauf- und Dienstplanoptimierung: Wie weit k\u00f6nnen diese bereits integriert werden? In: Heureka\u201908. Stiftung Heureka, FGSV Verlag (2008)"},{"key":"32_CR3","doi-asserted-by":"publisher","unstructured":"McCallum, A., Nigam, K., Ungar, L.H.: Efficient clustering of high-dimensional data sets with application to reference matching. In: Proceedings of ACM, KDD \u201900, pp. 169\u2013178. ACM, New York, NY, USA (2000). doi:\n10.1145\/347090.347123","DOI":"10.1145\/347090.347123"},{"key":"32_CR4","unstructured":"PTV AG. \nhttp:\/\/vision-traffic.ptvgroup.com\/en-us\/products\/ptv-visum\/"},{"key":"32_CR5","doi-asserted-by":"publisher","unstructured":"Torres, L.M., Torres, R., Bornd\u00f6rfer, R., Pfetsch, M.E.: Line Planning on paths and tree networks with applications to the quito trolebus system. In: Fischetti, M., Widmayer, P. (eds.) ATMOS\u201908, OpenAccess Series in Informatics (OASIcs), vol.\u00a09. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2008). doi:\n10.4230\/OASIcs.ATMOS.2008.1583\n\n. \nhttp:\/\/drops.dagstuhl.de\/opus\/volltexte\/2008\/1583","DOI":"10.4230\/OASIcs.ATMOS.2008.1583"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55702-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T14:28:18Z","timestamp":1500560898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55702-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,21]]},"ISBN":["9783319557014","9783319557021"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55702-1_32","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2017,7,21]]}}}