{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T10:12:24Z","timestamp":1784110344635,"version":"3.55.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,3]],"date-time":"2010-11-03T00:00:00Z","timestamp":1288742400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s11590-010-0256-0","type":"journal-article","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T14:29:32Z","timestamp":1288708172000},"page":"141-152","source":"Crossref","is-referenced-by-count":19,"title":["3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Sai","family":"Yadlapalli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sivakumar","family":"Rathinam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Swaroop","family":"Darbha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,11,3]]},"reference":[{"key":"256_CR1","doi-asserted-by":"crossref","unstructured":"Chandler, P., Pachter, M.: Research issues in autonomous control of tactical UAVs. In: Proceedings of the American Control Conference, pp. 394\u2013398 (1998)","DOI":"10.1109\/ACC.1998.694698"},{"key":"256_CR2","doi-asserted-by":"crossref","unstructured":"Chandler, P., Pachter, M., Swaroop, D., Fowler, J.M., Howlett, J.K., Rasmussen, S., Schumacher, C., Nygard, K.: Complexity in UAV cooperative control. In: Proceedings of the American Control Conference, pp. 1831\u20131836 (2002)","DOI":"10.1109\/ACC.2002.1023833"},{"key":"256_CR3","doi-asserted-by":"crossref","unstructured":"Lagoudakis, M., Markakis, V., Kempe, D., Keskinocak, P., Koenig, S., Kleywegt, A., Tovey, C., Meyerson, A., Jain, S.: Auction-based multi-robot routing. In Proceedings of the International Conference on Robotics: Science and Systems, pp. 343\u2013350 (2005)","DOI":"10.15607\/RSS.2005.I.045"},{"key":"256_CR4","doi-asserted-by":"crossref","unstructured":"Tisdale, J., Ryan, A., Zennaro, M., Xiao, X., Caveney, D., Rathinam, S., Hedrick, J.K., Sengupta, R.: The software architecture of the Berkeley UAV platform. In: IEEE Conference on Control Applications, Munich, Germany (2006)","DOI":"10.1109\/CCA.2006.286066"},{"key":"256_CR5","volume-title":"The Travelling Salesman Problem and its Variations","year":"2002","unstructured":"Gutin, G., Punnen, A.P. (eds): The Travelling Salesman Problem and its Variations. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"256_CR6","doi-asserted-by":"crossref","first-page":"3935","DOI":"10.1007\/978-0-387-74759-0_687","volume-title":"Encyclopedia of Optimization","author":"G. Gutin","year":"2009","unstructured":"Gutin G.: Traveling Salesman Problem. In: Floudas, C.A., Pardalos, P.M. (eds) Encyclopedia of Optimization, pp. 3935\u20133944. Springer, USA (2009)"},{"key":"256_CR7","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani V.V.: Approximation Algorithms. Springer, Berlin (2001)"},{"key":"256_CR8","doi-asserted-by":"crossref","unstructured":"Du, D., Pardalos, P. M. (eds). Handbook of Combinatorial Optimization, vol. 1\u20133 (1999)","DOI":"10.1007\/978-1-4757-3023-4"},{"key":"256_CR9","doi-asserted-by":"crossref","first-page":"1498","DOI":"10.1007\/978-0-387-74759-0_262","volume-title":"Encyclopedia of Optimization","author":"Y. Marinakis","year":"2009","unstructured":"Marinakis Y.: Heuristic and Metaheuristic Algorithms for the Traveling Salesman Problem. In: Floudas, C.A., Pardalos, P.M. (eds) Encyclopedia of Optimization, pp. 1498\u20131506. Springer, USA (2009)"},{"key":"256_CR10","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"2001","unstructured":"Lawler E.L.: Combinatorial Optimization: Networks and Matroids. Dover Publications, USA (2001)"},{"key":"256_CR11","volume-title":"The Traveling Salesman-Computational Solutions for TSP Allocations, Lecture Notes in Computer Science 840","author":"G. Reinelt","year":"1994","unstructured":"Reinelt G.: The Traveling Salesman-Computational Solutions for TSP Allocations, Lecture Notes in Computer Science 840. Springer, Berlin (1994)"},{"key":"256_CR12","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the Traveling Salesman Problem, Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh (1976)"},{"issue":"6","key":"256_CR13","doi-asserted-by":"crossref","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)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"256_CR14","doi-asserted-by":"crossref","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 multi-vehicle systems with non-holonomic constraints. IEEE Trans. Autom. Sci. Eng. 4(1), 98\u2013104 (2007)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"256_CR15","doi-asserted-by":"crossref","unstructured":"Rathinam, S., Sengupta, R.: Lower and upper bounds for a multiple depot UAV Routing Problem. In: IEEE Control and Decision Conference, San Diego, California (2006)","DOI":"10.1109\/CDC.2006.377732"},{"issue":"1","key":"256_CR16","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 for a 2-Depot, Hamiltonian path problem. Oper. Res. Lett. 38(1), 63\u201368 (2010)","journal-title":"Oper. Res. Lett."},{"key":"256_CR17","doi-asserted-by":"crossref","unstructured":"Xu, Z., Rodrigues, B.: A 3\/2-approximation algorithm for multiple depot multiple traveling salesman problem, algorithm theory\u2014SWAT 2010, Lecture Notes in Computer Science, Springer Berlin\/Heidelberg vol. 6139, pp. 127\u2013138 (2010)","DOI":"10.1007\/978-3-642-13731-0_13"},{"key":"256_CR18","doi-asserted-by":"crossref","unstructured":"Yadlapalli, S., Rathinam, S., Darbha, S.: An approximation algorithm for a heterogenous, multiple vehicle, multiple travelling salesman problem. American Control Conference (2009)","DOI":"10.1109\/ACC.2009.5160738"},{"key":"256_CR19","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K. Menger","year":"1927","unstructured":"Menger K.: Zur allgemeinen Kurventheorie. Fund. Math. 10, 96\u2013115 (1927)","journal-title":"Fund. Math."},{"issue":"2","key":"256_CR20","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Grotschel","year":"1981","unstructured":"Grotschel M., Lovasz L., Schrijver A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169\u2013197 (1981)","journal-title":"Combinatorica"},{"issue":"6","key":"256_CR21","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0020-0190(90)90028-V","volume":"35","author":"D.B. Shmoys","year":"1990","unstructured":"Shmoys D.B., Williamson D.P.: Analyzing the Held-Karp TSP bound: a monotonicity property with application. Inf. Process. Lett. 35(6), 281\u2013285 (1990)","journal-title":"Inf. Process. Lett."},{"key":"256_CR22","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF01580607","volume":"60","author":"M.X. Goemans","year":"1993","unstructured":"Goemans M.X., Bertsimas D.: Survivable networks, linear programming relaxations and the parsimonius property. Math. Program. 60, 143\u2013166 (1993)","journal-title":"Math. Program."},{"key":"256_CR23","volume-title":"Flows in Networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"Ford L.R. Jr., Fulkerson D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0256-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-010-0256-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0256-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T01:15:26Z","timestamp":1559783726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-010-0256-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,3]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["256"],"URL":"https:\/\/doi.org\/10.1007\/s11590-010-0256-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,3]]}}}