{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:48:07Z","timestamp":1770994087775,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031813955","type":"print"},{"value":"9783031813962","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-81396-2_13","type":"book-chapter","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T23:14:23Z","timestamp":1739315663000},"page":"183-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of\u00a0Fixed Order Routing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-4478-8115","authenticated-orcid":false,"given":"Steven","family":"Miltenburg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8509-7002","authenticated-orcid":false,"given":"Tim","family":"Oosterwijk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0385-0794","authenticated-orcid":false,"given":"Ren\u00e9","family":"Sitters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,12]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1137\/20M1326167","volume":"51","author":"A Adamaszek","year":"2022","unstructured":"Adamaszek, A., Czumaj, A., Englert, M., R\u00e4cke, H.: Almost tight bounds for reordering buffer management. SIAM J. Comput. 51(3), 701\u2013722 (2022)","journal-title":"SIAM J. Comput."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1051\/ita\/1986200100791","volume":"20","author":"FN Afrati","year":"1986","unstructured":"Afrati, F.N., Cosmadakis, S.S., Papadimitriou, C.H., Papageorgiou, G., Papakostantinou, N.: The complexity of the travelling repairman problem. RAIRO Theor. Inform. Appl. 20, 79\u201387 (1986)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0167-6377(87)90012-5","volume":"6","author":"K Altinkemer","year":"1987","unstructured":"Altinkemer, K., Gavish, B.: Heuristics for unequal weight delivery problems with a fixed error guarantee. Oper. Res. Lett. 6, 149\u2013158 (1987)","journal-title":"Oper. Res. Lett."},{"key":"13_CR4","unstructured":"Asano, T., Katoh, N., Tamaki, H., Tokuyama, T.: Covering points in the plane by k-tours: a polynomial approximation scheme for fixed k. Technical report RT0162, IBM Tokyo Research Laboratory (1996)"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10107-022-01841-4","volume":"197","author":"J Blauth","year":"2023","unstructured":"Blauth, J., Traub, V., Vygen, J.: Improving the approximation ratio for capacitated vehicle routing. Math. Program. 197(2), 451\u2013497 (2023)","journal-title":"Math. Program."},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-030-17953-3_7","volume-title":"Integer Programming and Combinatorial Optimization","author":"T Bosman","year":"2019","unstructured":"Bosman, T., Frascaria, D., Olver, N., Sitters, R., Stougie, L.: Fixed-order scheduling on parallel machines. In: Lodi, A., Nagarajan, V. (eds.) IPCO 2019. LNCS, vol. 11480, pp. 88\u2013100. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17953-3_7"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., Van Nieuwenhuyse, I.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99, 300\u2013313 (2016)","journal-title":"Comput. Ind. Eng."},{"key":"13_CR8","unstructured":"Chrobak, M., Karloff, H., Payne, T., Vishwanathan, S.: New results on server problems. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201990, pp. 291\u2013300, USA. Society for Industrial and Applied Mathematics (1990)"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/0404017","volume":"4","author":"M Chrobak","year":"1991","unstructured":"Chrobak, M., Karloof, H., Payne, T., Vishwnathan, S.: New results on server problems. SIAM J. Discret. Math. 4(2), 172\u2013181 (1991)","journal-title":"SIAM J. Discret. Math."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1137\/S0895480195281878","volume":"11","author":"V Deineko","year":"1998","unstructured":"Deineko, V., Rudolf, R., Woeginger, G.: Sometimes travelling is easy: the master tour problem. SIAM J. Discrete Math. 11, 81\u201393 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"13_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Company, San Francisco (1979)"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"Mordecai Haimovich and Alexander Rinnooy Kan","year":"1985","unstructured":"Mordecai Haimovich and Alexander Rinnooy Kan: Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10(4), 527\u2013542 (1985)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V Kann","year":"1991","unstructured":"Kann, V.: Maximum bounded 3-dimensional matching is MAX SNP-complete. Inf. Process. Lett. 37(1), 27\u201335 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"13_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0020-0190(94)90105-8","volume":"49","author":"V Kann","year":"1994","unstructured":"Kann, V.: Maximum bounded h-matching is MAX SNP-complete. Inf. Process. Lett. 49(6), 309\u2013318 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.cosrev.2009.04.002","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E.: The k-server problem. Comput. Sci. Rev. 3(2), 105\u2013118 (2009)","journal-title":"Comput. Sci. Rev."},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-61440-0_135","volume-title":"Automata, Languages and Programming","author":"E Koutsoupias","year":"1996","unstructured":"Koutsoupias, E., Papadimitriou, C., Yannakakis, M.: Searching a fixed graph. In: Meyer, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 280\u2013289. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61440-0_135"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for on-line problems. In: Symposium on the Theory of Computing (1988)","DOI":"10.1145\/62212.62243"},{"key":"13_CR18","first-page":"12","volume":"19","author":"C Mathieu","year":"2022","unstructured":"Mathieu, C., Zhou, H.: A PTAS for capacitated vehicle routing on trees. ACM Trans. Algorithms 19, 12 (2022)","journal-title":"ACM Trans. Algorithms"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"M\u00f6mke, T., Zhou, H.: Capacitated vehicle routing in graphic metrics. In: Symposium on Simplicity in Algorithms (SOSA), pp. 114\u2013123 (2023)","DOI":"10.1137\/1.9781611977585.ch11"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.18.1.1","volume":"18","author":"CH Papadimitriou","year":"1993","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The Traveling Salesman Problem with distances one and two. Math. Oper. Res. 18, 1\u201311 (1993)","journal-title":"Math. Oper. Res."},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.tcs.2020.11.042","volume":"855","author":"VR Vijayalakshmi","year":"2021","unstructured":"Vijayalakshmi, V.R., Schr\u00f6der, M., Tamir, T.: Scheduling games with machine-dependent priority lists. Theoret. Comput. Sci. 855, 90\u2013103 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Nav. Res. Logist. Q. 3, 59\u201366 (1956)","journal-title":"Nav. Res. Logist. Q."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D., (eds.): Vehicle Routing, volume\u00a018 of MOS-SIAM Series on Optimization. SIAM (2014)","DOI":"10.1137\/1.9781611973594"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81396-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T23:14:26Z","timestamp":1739315666000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81396-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031813955","9783031813962"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81396-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"12 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Egham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2024\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}