{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T21:01:08Z","timestamp":1744405268036},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,8,2]],"date-time":"2015-08-02T00:00:00Z","timestamp":1438473600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s11590-015-0924-1","type":"journal-article","created":{"date-parts":[[2015,8,1]],"date-time":"2015-08-01T07:32:29Z","timestamp":1438414349000},"page":"1269-1285","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Jungyun","family":"Bae","sequence":"first","affiliation":[]},{"given":"Sivakumar","family":"Rathinam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,2]]},"reference":[{"key":"924_CR1","volume-title":"Worst-case analysis of a new heuristic for the travelling salesman problem","author":"N Christofides","year":"1976","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Carnegie Mellon University, Pittsburgh (1976)"},{"key":"924_CR2","doi-asserted-by":"crossref","unstructured":"Feithans, G.L., Rowe, A.J., Davis, J.E., Holland, M., Berger, L.: Vigilant spirit control station (vscs)the face of counter. In: Proceedings of the AIAA Guidance, Navigation and Control Conference Exhibition. AIAA (2008)","DOI":"10.2514\/6.2008-6309"},{"issue":"2","key":"924_CR3","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"924_CR4","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1016\/j.orl.2007.02.001","volume":"35","author":"W Malik","year":"2007","unstructured":"Malik, W., Rathinam, S., Darbha, S.: An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem. Oper. Res. Lett. 35(6), 747\u2013753 (2007). doi: 10.1016\/j.orl.2007.02.001","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"924_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.orl.2009.10.001","volume":"38","author":"S Rathinam","year":"2010","unstructured":"Rathinam, S., Sengupta, R.: 3\/2-approximation algorithm for two variants of a 2-depot hamiltonian path problem. Oper. Res. Lett. 38(1), 63\u201368 (2010)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"924_CR6","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/TASE.2006.872110","volume":"4","author":"S Rathinam","year":"2007","unstructured":"Rathinam, S., Sengupta, R., Darbha, S.: A resource allocation algorithm for multivehicle systems with nonholonomic constraints. Autom. Sci. Eng. IEEE Trans. 4(1), 98\u2013104 (2007). doi: 10.1109\/TASE.2006.872110","journal-title":"Autom. Sci. Eng. IEEE Trans."},{"issue":"2","key":"924_CR7","doi-asserted-by":"crossref","first-page":"367","DOI":"10.2140\/pjm.1990.145.367","volume":"145","author":"J Reeds","year":"1990","unstructured":"Reeds, J., Shepp, L.: Optimal paths for a car that goes both forwards and backwards. Pac. J. Math. 145(2), 367\u2013393 (1990)","journal-title":"Pac. J. Math."},{"key":"924_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/TASE.2013.2279544","volume":"11","author":"K Sundar","year":"2013","unstructured":"Sundar, K., Rathinam, S.: Algorithms for routing an unmanned aerial vehicle in the presence of refueling depots. Autom. Sci. Eng. IEEE Trans. 11, 287 (2013). doi: 10.1109\/TASE.2013.2279544","journal-title":"Autom. Sci. Eng. IEEE Trans."},{"key":"924_CR9","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)"},{"key":"924_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11590-010-0256-0","volume":"6","author":"S YadlapallI","year":"2010","unstructured":"YadlapallI, S., Rathinam, S., Darbha, S.: 3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem. Optim. Lett. 6, 1\u201312 (2010). doi: 10.1007\/s11590-010-0256-0","journal-title":"Optim. Lett."},{"key":"924_CR11","doi-asserted-by":"crossref","unstructured":"G\u00f8rtz, I.L., Molinaro, M., Nagarajan, V., Ravi, R.: Capacitated vehicle routing with non-uniform speeds. In: Integer Programming and Combinatoral Optimization (IPCO), LNCS 6655, pp. 235\u2013247. Springer (2011)","DOI":"10.1007\/978-3-642-20807-2_19"},{"key":"924_CR12","doi-asserted-by":"crossref","unstructured":"Bae, J., Rathinam, S.: An approximation algorithm for a heterogeneous traveling salesman problem. ASME Dynamic Systems and Control Conference, pp. 637\u2013644. Arlington, Virginia, 31 Oct\u20132 Nov 2011","DOI":"10.1115\/DSCC2011-6098"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0924-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0924-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0924-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:43Z","timestamp":1559409103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0924-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,2]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["924"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0924-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,2]]}}}