{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:48:32Z","timestamp":1768340912922,"version":"3.49.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.23919\/acc.2017.7963559","type":"proceedings-article","created":{"date-parts":[[2017,7,10]],"date-time":"2017-07-10T21:39:58Z","timestamp":1499722798000},"page":"3944-3949","source":"Crossref","is-referenced-by-count":9,"title":["Multiple traveling salesmen and related problems: A maximum-entropy principle based approach"],"prefix":"10.23919","author":[{"given":"Mayank","family":"Baranwal","sequence":"first","affiliation":[]},{"given":"Brian","family":"Roehl","sequence":"additional","affiliation":[]},{"given":"Srinivasa M.","family":"Salapaka","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2292726"},{"key":"ref11","author":"rose","year":"1990","journal-title":"Deterministic annealing clustering and optimization"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2016.7525010"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00380-X"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.16.6.B373"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2015.7171176"},{"key":"ref16","year":"0","journal-title":"Simulated annealing in matlab"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321847"},{"key":"ref3","first-page":"11","article-title":"Certification of an optimal tsp tour through 85, 900 cities","volume":"37","author":"applegate","year":"2009","journal-title":"Operations Resarch"},{"key":"ref6","author":"mennell","year":"2009","journal-title":"Heuristics for Solving Three Routing Problems Close-Enough Traveling Salesman Problem Close-Enough Vehicle Routing Problem Sequence-Dependent Team Orienteering Problem"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-39934-8_16"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.93"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/5.726788"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.10.004"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(05)80121-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2003.1272864"}],"event":{"name":"2017 American Control Conference (ACC)","location":"Seattle, WA, USA","start":{"date-parts":[[2017,5,24]]},"end":{"date-parts":[[2017,5,26]]}},"container-title":["2017 American Control Conference (ACC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7951530\/7962914\/07963559.pdf?arnumber=7963559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T20:00:37Z","timestamp":1624478437000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7963559\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":17,"URL":"https:\/\/doi.org\/10.23919\/acc.2017.7963559","relation":{},"subject":[],"published":{"date-parts":[[2017,5]]}}}