{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T21:42:17Z","timestamp":1771623737730,"version":"3.50.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T00:00:00Z","timestamp":1672617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T00:00:00Z","timestamp":1672617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s11590-022-01960-z","type":"journal-article","created":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T10:25:17Z","timestamp":1672655117000},"page":"1873-1888","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving the probabilistic profitable tour problem on a line"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1847-9331","authenticated-orcid":false,"given":"Enrico","family":"Angelelli","sequence":"first","affiliation":[]},{"given":"Renata","family":"Mansini","sequence":"additional","affiliation":[]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,2]]},"reference":[{"key":"1960_CR1","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.tcs.2014.02.046","volume":"531","author":"E Angelelli","year":"2014","unstructured":"Angelelli, E., Bazgan, C., Speranza, M.G., Tuza, Sz.: Complexity and approximation for traveling salesman problems with profits. Theor. Comput. Sci. 531, 54\u201365 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"1960_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.cor.2016.12.025","volume":"81","author":"E Angelelli","year":"2017","unstructured":"Angelelli, E., Archetti, C., Filippi, C., Vindigni, M.: The probabilistic orienteering problem. Comput. & Oper. Res. 81, 269\u2013281 (2017)","journal-title":"Comput. & Oper. Res."},{"key":"1960_CR3","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transp. Sci. 39, 188\u2013205 (2005)","journal-title":"Transp. Sci."},{"issue":"2","key":"1960_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","volume":"255","author":"A Gunawan","year":"2016","unstructured":"Gunawan, A., Lau, H.C., Vansteenwegen, P.: Orienteering problem: A survey of recent variants, solution approaches and applications. Eur. J. Oper. Res. 255(2), 315\u2013332 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"1960_CR5","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.disopt.2014.08.001","volume":"14","author":"MK Jepsen","year":"2014","unstructured":"Jepsen, M.K., Petersen, B., Spoorendonk, S., Pisinger, D.: A branch-and-cut algorithm for the capacitated profitable tour problem. Discrete Optim. 14, 78\u201396 (2014)","journal-title":"Discrete Optim."},{"key":"1960_CR6","unstructured":"Johnson, D.S., Minkoff, M., Phillips, S.: The prize collecting Steiner tree problem: theory and practice, in: Proceedings of the 11-th ACM\u2013SIAM Symposium on Discrete Algorithms, San Francisco, 2000, pp. 760\u2013769 (2000)"},{"key":"1960_CR7","doi-asserted-by":"crossref","unstructured":"Klau, G.W., Ljubic, I., Mutzel, P., Pferschy, U., Weiskircher, R.: The fractional prize-collecting steiner tree problem on trees. In: Proceedings of the 11-th Annual European Symposium on Algorithms,ESA2003, in: LNCS, vol. 2832, 2003, pp. 691\u2013702 (2003)","DOI":"10.1007\/978-3-540-39658-1_62"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01960-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01960-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01960-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T08:20:38Z","timestamp":1695198038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01960-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,2]]},"references-count":7,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1960"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01960-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,2]]},"assertion":[{"value":"1 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}