{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:55:45Z","timestamp":1763466945677,"version":"3.45.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032091192","type":"print"},{"value":"9783032091208","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-09120-8_6","type":"book-chapter","created":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:52:34Z","timestamp":1763466754000},"page":"76-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Temporal Orienteering with\u00a0Changing Fuel Costs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1055-5627","authenticated-orcid":false,"given":"Timoth\u00e9e","family":"Corsini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0266-3292","authenticated-orcid":false,"given":"Jessica","family":"Enright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3322-0176","authenticated-orcid":false,"given":"Laura","family":"Larios-Jones","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5299-3073","authenticated-orcid":false,"given":"Kitty","family":"Meeks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,19]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.jcss.2021.04.001","volume":"120","author":"EC Akrida","year":"2021","unstructured":"Akrida, E.C., Mertzios, G.B., Spirakis, P.G., Raptopoulos, C.: The temporal explorer who returns to the base. J. Comput. Syst. Sci. 120, 179\u2013193 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844\u2013856 (1995). https:\/\/doi.org\/10.1145\/210332.210337","DOI":"10.1145\/210332.210337"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Blum, A., Vempala, S.: Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. In: Proceedings of the twenty-seventh annual ACM Symp. Theor. Comput. 277\u2013283 (1995)","DOI":"10.1145\/225058.225139"},{"issue":"6","key":"6_CR4","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas, E.: The prize collecting traveling salesman problem. Networks 19(6), 621\u2013636 (1989)","journal-title":"Networks"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/050645464","volume":"37","author":"A Blum","year":"2007","unstructured":"Blum, A., Chawla, S., Karger, D.R., Lane, T., Meyerson, A., Minkoff, M.: Approximation algorithms for orienteering and discounted-reward tsp. SIAM J. Comput. 37(2), 653\u2013670 (2007)","journal-title":"SIAM J. Comput."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Buchin, K., Hagedoorn, M., Li, G., Rehs, C.: Orienteering (with time windows) on restricted graph classes. In: International Conference on Current Trends in Theory and Practice of Computer Science, pp. 151\u2013165. Springer (2025)","DOI":"10.1007\/978-3-031-82670-2_12"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Bumpus, B.M., Meeks, K.: Edge exploration of temporal graphs. corr, abs\/2103.05387. arXiv preprint arXiv:2103.05387 (2021)","DOI":"10.1007\/978-3-030-79987-8_8"},{"issue":"5","key":"6_CR8","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387\u2013408 (2012)","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2229163.2229167","volume":"8","author":"C Chekuri","year":"2012","unstructured":"Chekuri, C., Korula, N., P\u00e1l, M.: Improved algorithms for orienteering and related problems. ACM Trans. Algorithms (TALG) 8(3), 1\u201327 (2012)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"6_CR10","unstructured":"Enright, J., Hand, S.D., Larios-Jones, L., Meeks, K.: Families of tractable problems with respect to vertex-interval-membership width and its generalisations. arXiv preprint arXiv:2505.15699 (2025)"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transp. Sci. 39(2), 188\u2013205 (2005). https:\/\/doi.org\/10.1287\/trsc.1030.0079, publisher: INFORMS","DOI":"10.1287\/trsc.1030.0079"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lingas, A.: Approximation algorithms for time-dependent orienteering. Inf. Process. Lett. (2002)","DOI":"10.1007\/3-540-44669-9_57"},{"key":"6_CR13","unstructured":"Gavish, B., Graves, S.C.: The travelling salesman problem and related problems. Working Paper, Massachusetts Institute of Technology, Operations Research Center, July 1978, https:\/\/dspace.mit.edu\/handle\/1721.1\/5363, Accepted 28 May 2004 T19:35:47Z"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Naval Res. Logist. (NRL) 34(3), 307\u2013318 (1987). https:\/\/doi.org\/10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24777-7","DOI":"10.1007\/978-3-540-24777-7"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G Laporte","year":"1990","unstructured":"Laporte, G., Martello, S.: The selective travelling salesman problem. Discret. Appl. Math. 26(2), 193\u2013207 (1990). https:\/\/doi.org\/10.1016\/0166-218X(90)90100-Q","journal-title":"Discret. Appl. Math."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-031-02462-7_9","volume-title":"Applications of Evolutionary Computation","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2022","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Chicano, F., Gil-Merino, R.: The asteroid routing problem: a benchmark for expensive black-box permutation optimization. In: Jim\u00e9nez Laredo, J.L., Hidalgo, J.I., Babaagba, K.O. (eds.) EvoApplications 2022. LNCS, vol. 13224, pp. 124\u2013140. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-02462-7_9"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Naor, M., Schulman, L., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proceedings of IEEE 36th Annual Foundations of Computer Science, pp. 182\u2013191 (1995). https:\/\/doi.org\/10.1109\/SFCS.1995.492475","DOI":"10.1109\/SFCS.1995.492475"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Vansteenwegen, P., Souffriau, W., Oudheusden, D.V.: The orienteering problem: a survey. Eur. J. Oper. Res. 209(1), 1\u201310 (2011)","DOI":"10.1016\/j.ejor.2010.03.045"}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09120-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:52:36Z","timestamp":1763466756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09120-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"ISBN":["9783032091192","9783032091208"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09120-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"19 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ALGOWIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmics of Wireless Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}