{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:20:02Z","timestamp":1772119202350,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T00:00:00Z","timestamp":1742860800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T00:00:00Z","timestamp":1742860800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["6636-548083-2020"],"award-info":[{"award-number":["6636-548083-2020"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2020-06423"],"award-info":[{"award-number":["RGPIN-2020-06423"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s00236-025-00486-y","type":"journal-article","created":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:58:47Z","timestamp":1743051527000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The thief orienteering problem on 2-terminal series\u2013parallel graphs"],"prefix":"10.1007","volume":"62","author":[{"given":"Andrew","family":"Bloch-Hansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Solis-Oba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,25]]},"reference":[{"key":"486_CR1","doi-asserted-by":"crossref","unstructured":"Abdelkader, R., Abdelkader, Z., Mustapha, R., Yamani, M.: Optimal allocation of reliability in series parallel production system, pp. 241\u2013258. In Search Algorithms for Engineering Optimization, InTechOpen, Croatia (2013)","DOI":"10.5772\/55725"},{"key":"486_CR2","doi-asserted-by":"crossref","unstructured":"Bloch-Hansen, A., Page, D., Solis-Oba, R.: A polynomial-time approximation scheme for thief orienteering on directed acyclic graphs. In International Workshop on Combinatorial Algorithms (IWOCA), pp. 87\u201398. Springer (2023)","DOI":"10.1007\/978-3-031-34347-6_8"},{"key":"486_CR3","doi-asserted-by":"crossref","unstructured":"Bloch-Hansen, A., Solis-Oba, R., Page, D.: Algorithms for the thief orienteering problem on directed acyclic graphs. J. Theoret. Comput. Sci. 1023, (2025)","DOI":"10.1016\/j.tcs.2024.114900"},{"key":"486_CR4","doi-asserted-by":"crossref","unstructured":"Bonyadi, M., Michalewicz, Z., Barone, L.: The travelling thief problem: the first step in the transition from theoretical problems to realistic problems. In IEEE Congress on Evolutionary Computation (CEC), pp. 1037\u20131044. IEEE (2013)","DOI":"10.1109\/CEC.2013.6557681"},{"issue":"6","key":"486_CR5","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1016\/j.orl.2020.08.011","volume":"48","author":"J Chagas","year":"2020","unstructured":"Chagas, J., Wagner, M.: Ants can orienteer a thief in their robbery. Oper. Res. Lett. 48(6), 708\u2013714 (2020)","journal-title":"Oper. Res. Lett."},{"issue":"8","key":"486_CR6","doi-asserted-by":"publisher","first-page":"2313","DOI":"10.1007\/s11590-021-01824-y","volume":"16","author":"J Chagas","year":"2022","unstructured":"Chagas, J., Wagner, M.: Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach. Optim. Lett. 16(8), 2313\u20132331 (2022)","journal-title":"Optim. Lett."},{"issue":"8","key":"486_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"1","author":"F Chung","year":"1987","unstructured":"Chung, F., Leighton, F., Rosenberg, A.: Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Algeb. Discrete Methods 1(8), 33\u201358 (1987)","journal-title":"SIAM J. Algeb. Discrete Methods"},{"issue":"10","key":"486_CR8","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"2","author":"R Duffin","year":"1965","unstructured":"Duffin, R.: Topology of series-parallel networks. J. Math. Anal. Appl. 2(10), 303\u2013318 (1965)","journal-title":"J. Math. Anal. Appl."},{"key":"486_CR9","doi-asserted-by":"crossref","unstructured":"Fa\u00eada, L., Santos, A.: A genetic algorithm for the thief orienteering problem. In 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE, (2020)","DOI":"10.1109\/CEC48606.2020.9185848"},{"issue":"1","key":"486_CR10","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.ejor.2017.09.025","volume":"266","author":"N Freeman","year":"2018","unstructured":"Freeman, N., Keskin, B., \u00c7apar, \u0130: Attractive orienteering problem with proximity and timing interactions. Eur. J. Oper. Res. 266(1), 354\u2013370 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"486_CR11","doi-asserted-by":"publisher","first-page":"2752","DOI":"10.1016\/j.cor.2013.05.019","volume":"40","author":"J Gago","year":"2013","unstructured":"Gago, J., Hartillo, I., Puerto, J., Ucha, J.: Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method. Comput. Oper. Res. 40(11), 2752\u20132759 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"486_CR12","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., 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":"486_CR13","doi-asserted-by":"crossref","unstructured":"Santos, A., Chagas, J.: The thief orienteering problem: Formulation and heuristic approaches. In IEEE Congress on Evolutionary Computation, pp. 1\u20139 (2018)","DOI":"10.1109\/CEC.2018.8477853"},{"key":"486_CR14","unstructured":"Valdes, J.: Parsing flowcharts and series-parallel graphs. Ph.D. dissertation, Standford University, (1978)"},{"key":"486_CR15","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1007\/s00170-015-7065-7","volume":"80","author":"J Wang","year":"2015","unstructured":"Wang, J., Wu, X., Fan, X.: A two-stage ant colony optimization approach based on a directed graph for process planning. Int. J. Adv. Manuf. Technol. 80, 839\u2013850 (2015)","journal-title":"Int. J. Adv. Manuf. Technol."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00486-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-025-00486-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00486-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T07:42:35Z","timestamp":1750146155000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-025-00486-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,25]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["486"],"URL":"https:\/\/doi.org\/10.1007\/s00236-025-00486-y","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4208548\/v1","asserted-by":"object"}]},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,25]]},"assertion":[{"value":"2 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"18"}}