{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T06:41:41Z","timestamp":1781678501449,"version":"3.54.5"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1109\/acc.2009.5160738","type":"proceedings-article","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T19:56:27Z","timestamp":1248119787000},"page":"1730-1735","source":"Crossref","is-referenced-by-count":5,"title":["An approximation algorithm for a 2-Depot, heterogeneous vehicle routing problem"],"prefix":"10.1109","author":[{"given":"Sai Krishna","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":"263","reference":[{"key":"3","article-title":"the traveling salesman - computational solutions for tsp applications","volume":"840","author":"reinelt","year":"1994","journal-title":"Lecture Notes in Computer Science"},{"key":"2","author":"lawler","year":"2000","journal-title":"Combinatorial Optimization Networks and Matroids"},{"key":"10","year":"0"},{"key":"1","year":"0"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2006.872110"},{"key":"6","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1287\/opre.25.5.871","article-title":"a note on the symmetric multiple travelling salesman problem with fixed charges","volume":"25","author":"bellmore","year":"1977","journal-title":"Operations Research"},{"key":"5","article-title":"worst-case analysis of a new heuristic for the traveling salesman problem","author":"christofides","year":"1976"},{"key":"4","author":"vazirani","year":"2001","journal-title":"Approximation Algorithms Springer"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377732"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2007.02.001"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-010-9341-1"}],"event":{"name":"2009 American Control Conference","location":"St. Louis, MO, USA","start":{"date-parts":[[2009,6,10]]},"end":{"date-parts":[[2009,6,12]]}},"container-title":["2009 American Control Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5089257\/5159764\/05160738.pdf?arnumber=5160738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T22:06:58Z","timestamp":1497823618000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5160738\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/acc.2009.5160738","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}