{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:32:46Z","timestamp":1740123166439,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,17]],"date-time":"2021-02-17T00:00:00Z","timestamp":1613520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,17]],"date-time":"2021-02-17T00:00:00Z","timestamp":1613520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10479-021-03981-w","type":"journal-article","created":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T12:55:35Z","timestamp":1613739335000},"page":"1039-1061","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["To stop or not to stop: a time-constrained trip covering location problem on a tree network"],"prefix":"10.1007","volume":"316","author":[{"given":"M. C.","family":"L\u00f3pez-de-los-Mozos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1594-7750","authenticated-orcid":false,"given":"Juan A.","family":"Mesa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,17]]},"reference":[{"key":"3981_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd, S. P., & Vanderberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press."},{"key":"3981_CR2","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1057\/jors.2016.3","volume":"67","author":"E Carrizosa","year":"2016","unstructured":"Carrizosa, E., Harbering, J., & Sch\u00f6bel, A. (2016). Minimizing the passengers\u2019 traveling time in the stop location problem. Journal of the Operational Research Society, 67, 1325\u20131337.","journal-title":"Journal of the Operational Research Society"},{"key":"3981_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-75857-2","volume-title":"Transportation system analysis","author":"E Cascetta","year":"2009","unstructured":"Cascetta, E. (2009). Transportation system analysis. New York: Springer."},{"key":"3981_CR4","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1287\/opre.24.4.628","volume":"24","author":"PM Dearing","year":"1976","unstructured":"Dearing, P. M., Francis, R. L., & Lowe, T. J. (1976). Convex location problems on tree networks. Operations Research, 24, 628\u2013642.","journal-title":"Operations Research"},{"key":"3981_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/atr.5670290202","volume":"29","author":"M Gendreau","year":"1995","unstructured":"Gendreau, M., Laporte, G., & Mesa, J. A. (1995). Locating rapid transit lines. Journal of Advanced Transportation, 29, 145\u2013162.","journal-title":"Journal of Advanced Transportation"},{"key":"3981_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1571-0661(04)00162-8","volume":"50","author":"HW Hamacher","year":"2001","unstructured":"Hamacher, H. W., Liebers, A., Sch\u00f6bel, A., Wagner, D., & Wagner, F. (2001). Locating new stops in a railway network. Electronic Notes in Theoretical Computer Science, 50, 1\u201311.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"3981_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s11750-012-0251-y","volume":"22","author":"M-C K\u00f6rner","year":"2014","unstructured":"K\u00f6rner, M.-C., Mesa, J. A., Perea, F., Sch\u00f6bel, A., & Scholz, D. (2014). A Maximum trip covering location problem with alternative mode of transportation on tree networks and segments. TOP, 22, 227\u2013253.","journal-title":"TOP"},{"key":"3981_CR8","first-page":"264","volume":"2653","author":"E Kranakis","year":"2003","unstructured":"Kranakis, E., Penna, P., Schlude, K., Taylor, D. S., & Widmayer, P. (2003). Improving customers proximity to railway station. LNCS, 2653, 264\u2013276.","journal-title":"LNCS"},{"key":"3981_CR9","unstructured":"Laporte, G., & Mesa, J. A. (2020). The design of rapid transit networks. In G. Laporte, S. Nickel & F. Saldanha-da-Gama (Eds.), \u201cLocation Science\u201d 2nd Edition, Chapter 24 (pp. 685\u2013702). Berlin-Heidelberg: Springer."},{"key":"3981_CR10","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1016\/S0305-0548(00)00013-7","volume":"29","author":"G Laporte","year":"2002","unstructured":"Laporte, G., Mesa, J. A., & Ortega, F. A. (2002). Locating stations on rapid transit lines. Computers & Operations Research, 29, 741\u2013759.","journal-title":"Computers & Operations Research"},{"key":"3981_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10479-005-2038-0","volume":"136","author":"G Laporte","year":"2005","unstructured":"Laporte, G., Mesa, J. A., Ortega, F. A., & Sevillano, I. (2005). Maximizing trip coverage in the location of a single rapid transit alignment. Annals of Operations Research, 136, 49\u201363.","journal-title":"Annals of Operations Research"},{"key":"3981_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trb.2014.05.015","volume":"68","author":"G Laporte","year":"2014","unstructured":"Laporte, G., Mesa, J. A., & Perea, F. (2014). Adding a new station and a road link to a road\u2013rail network in the presence of modal competition. Transportation Research B, 68, 1\u201316.","journal-title":"Transportation Research B"},{"key":"3981_CR13","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.ejor.2016.12.025","volume":"260","author":"MC L\u00f3pez-de-los-Mozos","year":"2017","unstructured":"L\u00f3pez-de-los-Mozos, M. C., Mesa, J. A., & Sch\u00f6bel, A. (2017). A general approach for the location of transfer points on a network with a trip criterion and mixed distances. European Journal of Operational Research, 260, 108\u2013121.","journal-title":"European Journal of Operational Research"},{"key":"3981_CR14","first-page":"52","volume":"92","author":"S Mecke","year":"2006","unstructured":"Mecke, S., Sch\u00f6bel, A., & Wagner, D. (2006). The station location problem on two intersecting lines. Electronic Notes in Theoretical Computer Science, 92, 52\u201364.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"2","key":"3981_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s11750-008-0061-4","volume":"17","author":"DR Poetantro","year":"2009","unstructured":"Poetantro, D. R., Hamacher, H. W., Horn, S., & Sch\u00f6bel, A. (2009). Stop location design in public transportation networks: covering and accessibility objectives. TOP, 17(2), 335\u2013346.","journal-title":"TOP"},{"key":"3981_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10479-005-2046-0","volume":"136","author":"A Sch\u00f6bel","year":"2005","unstructured":"Sch\u00f6bel, A. (2005). Locating stops along bus or railway lines - A bicriteria problem. Annals of Operations Research, 136, 211\u2013227.","journal-title":"Annals of Operations Research"},{"key":"3981_CR17","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1142\/S0217595909002080","volume":"26","author":"A Sch\u00f6bel","year":"2009","unstructured":"Sch\u00f6bel, A., Hamacher, H., Liebers, A., & Wagner, D. (2009). The continuous stop location problem in public transportation networks. Asia-Pacific Journal of Operational Research, 26, 13\u201330.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"3981_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.3141\/1735-04","volume":"1735","author":"R van Nes","year":"2000","unstructured":"van Nes, R., & Bovy, P. H. L. (2000). Importance of objectives in urban transit-network design. Transportation Research Records: Journal of Transportation Research Board, 1735, 25\u201334.","journal-title":"Transportation Research Records: Journal of Transportation Research Board"},{"key":"3981_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1287\/trsc.2.4.303","volume":"2","author":"VR Vuchic","year":"1968","unstructured":"Vuchic, V. R., & Newell, G. F. (1968). Rapid transit interstation spacings for minimum travel time. Transportation Science, 2, 303\u2013339.","journal-title":"Transportation Science"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-03981-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-03981-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-03981-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T13:43:00Z","timestamp":1664977380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-03981-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,17]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["3981"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-03981-w","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2021,2,17]]},"assertion":[{"value":"2 February 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}