{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:59:48Z","timestamp":1757617188545,"version":"3.44.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T00:00:00Z","timestamp":1731110400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T00:00:00Z","timestamp":1731110400000},"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":["Math. Program."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10107-024-02159-z","type":"journal-article","created":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T02:57:57Z","timestamp":1731121077000},"page":"985-1008","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact and approximation algorithms for routing a convoy through a graph"],"prefix":"10.1007","volume":"213","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7724-8990","authenticated-orcid":false,"given":"Martijn","family":"van Ee","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"}]},{"given":"Ren\u00e9","family":"Sitters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3705-016X","authenticated-orcid":false,"given":"Andreas","family":"Wiese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,9]]},"reference":[{"key":"2159_CR1","unstructured":"van Ee, M., Oosterwijk, T., Sitters, R., Wiese, A.: Exact and approximation algorithms for routing a convoy through a graph. In: 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol. 272, pp. 86:1\u201386:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023)"},{"issue":"2","key":"2159_CR2","first-page":"5","volume":"23","author":"DH Oh","year":"2018","unstructured":"Oh, D.H., Wood, R.K., Lee, Y.H.: Optimal interdiction of a ground convoy. Mil. Oper. Res. 23(2), 5\u201318 (2018)","journal-title":"Mil. Oper. Res."},{"key":"2159_CR3","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Klein, N., Gharan, S.O.: A (slightly) improved approximation algorithm for metric TSP. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 32\u201345 (2021)","DOI":"10.1145\/3406325.3451009"},{"issue":"6","key":"2159_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3424306","volume":"67","author":"O Svensson","year":"2020","unstructured":"Svensson, O., Tarnawski, J., V\u00e9gh, L.A.: A constant-factor approximation algorithm for the asymmetric traveling salesman problem. J. ACM (JACM) 67(6), 1\u201353 (2020)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"2159_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1137\/20M1339313","volume":"51","author":"V Traub","year":"2022","unstructured":"Traub, V., Vygen, J.: An improved approximation algorithm for the asymmetric traveling salesman problem. SIAM J. Comput. 51(1), 139\u2013173 (2022)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"2159_CR6","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18(6), 1138\u20131162 (1970)","journal-title":"Oper. Res."},{"key":"2159_CR7","unstructured":"Slav\u00edk, P.: The Errand Scheduling Problem. Technical report (1997)"},{"key":"2159_CR8","first-page":"73","volume":"13","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: The Chinese postman problem. Oper. Res. 13, 73\u201377 (1965)","journal-title":"Oper. Res."},{"issue":"1","key":"2159_CR9","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese postman. Math. Program. 5(1), 88\u2013124 (1973)","journal-title":"Math. Program."},{"issue":"2","key":"2159_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/trsc.10.2.113","volume":"10","author":"MH Moore","year":"1976","unstructured":"Moore, M.H.: On the fastest route for convoy-type traffic in flowrate-constrained networks. Transp. Sci. 10(2), 113\u2013124 (1976)","journal-title":"Transp. Sci."},{"issue":"1","key":"2159_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10479-006-0068-x","volume":"147","author":"M Pascoal","year":"2006","unstructured":"Pascoal, M., Captivo, M.E.V., Cl\u00edmaco, J.C.N.: A comprehensive survey on the quickest path problem. Ann. Oper. Res. 147(1), 5\u201321 (2006)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"2159_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/opre.1040.0183","volume":"53","author":"P Chardaire","year":"2005","unstructured":"Chardaire, P., McKeown, G.P., Verity-Harrison, S.A., Richardson, S.B.: Solving a time-space network formulation for the convoy movement problem. Oper. Res. 53(2), 219\u2013230 (2005)","journal-title":"Oper. Res."},{"issue":"2","key":"2159_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1080\/14751790902985165","volume":"25","author":"PN Ram Kumar","year":"2009","unstructured":"Ram Kumar, P.N., Narendran, T.T.: A mathematical approach for variable speed convoy movement problem (CMP). Def. Secur. Anal. 25(2), 137\u2013155 (2009)","journal-title":"Def. Secur. Anal."},{"key":"2159_CR14","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, DTIC Document (1976)"},{"key":"2159_CR15","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: On approximating arbitrary metrices by tree metrics. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 161\u2013168 (998)","DOI":"10.1145\/276698.276725"},{"key":"2159_CR16","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1145\/321958.321974","volume":"23","author":"CH Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: On the complexity of edge traversing. J. ACM 23, 544\u2013554 (1976)","journal-title":"J. ACM"},{"key":"2159_CR17","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 174. Freeman, San Francisco (1979)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02159-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02159-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02159-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T00:39:06Z","timestamp":1757119146000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02159-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,9]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["2159"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02159-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2024,11,9]]},"assertion":[{"value":"7 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}