{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T05:23:40Z","timestamp":1761110620884,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T00:00:00Z","timestamp":1650240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,4,18]]},"DOI":"10.1145\/3476883.3524046","type":"proceedings-article","created":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T02:11:49Z","timestamp":1651716709000},"page":"52-59","source":"Crossref","is-referenced-by-count":1,"title":["A new approach to the traveling salesman problem"],"prefix":"10.1145","author":[{"given":"Weiqi","family":"Li","sequence":"first","affiliation":[{"name":"University of Michigan-Flint"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,5,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Emile Aarts and Jan K. Lenstra (Ed.). 2003. Local Search in Combinatorial Optimization. Princeton University Press Princeton NJ USA.  Emile Aarts and Jan K. Lenstra (Ed.). 2003. Local Search in Combinatorial Optimization. Princeton University Press Princeton NJ USA.","DOI":"10.1515\/9780691187563"},{"key":"e_1_3_2_1_2_1","volume-title":"Yorke","author":"Alligood Kathleen T.","year":"1997","unstructured":"Kathleen T. Alligood , Tim D. Sauer , and James A . Yorke . 1997 . Chaos : Introduction to Dynamical System. Springer , New York, NY, USA. Kathleen T. Alligood, Tim D. Sauer, and James A. Yorke. 1997. Chaos: Introduction to Dynamical System. Springer, New York, NY, USA."},{"key":"e_1_3_2_1_3_1","volume-title":"Cook","author":"Applegate David L.","year":"2006","unstructured":"David L. Applegate , Robert E. Bixby , and Va\u0161ek Chvat\u00e1l and William J . Cook . 2006 . The Traveling Salesman Problem: A Computational Study. Princeton University Press , Princeton, NJ, USA. David L. Applegate, Robert E. Bixby, and Va\u0161ek Chvat\u00e1l and William J. Cook. 2006. The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton, NJ, USA."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(78)80011-3"},{"volume-title":"Introduction to Dynamical Systems (2nd. ed","author":"Bring Michael","key":"e_1_3_2_1_6_1","unstructured":"Michael Bring and Garrett Stuck . 2002. Introduction to Dynamical Systems (2nd. ed . ) Cambridge University Press , Cambridge, United Kingdom. Michael Bring and Garrett Stuck. 2002. Introduction to Dynamical Systems (2nd. ed.) Cambridge University Press, Cambridge, United Kingdom."},{"volume-title":"A Modern Introduction to Dynamical Systems","author":"Brown Richard J.","key":"e_1_3_2_1_7_1","unstructured":"Richard J. Brown . 2018. A Modern Introduction to Dynamical Systems . Oxford University Press , Oxford, England . Richard J. Brown. 2018. A Modern Introduction to Dynamical Systems. Oxford University Press, Oxford, England."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251244"},{"volume-title":"The P Versus NP Problem","author":"Cook Stephen","key":"e_1_3_2_1_9_1","unstructured":"Stephen Cook . 2001. The P Versus NP Problem . Clay Mathematics Institute . http:\/\/www.claymath.org\/sites\/default\/files\/pvsnp.pdf. Stephen Cook. 2001. The P Versus NP Problem. Clay Mathematics Institute. http:\/\/www.claymath.org\/sites\/default\/files\/pvsnp.pdf."},{"volume-title":"Proceedings of the 15th National Conference on Artificial Intelligence. Association for Advancement of Artificial Intelligence","author":"Edelkamp Stefan","key":"e_1_3_2_1_10_1","unstructured":"Stefan Edelkamp and Richard E. Korf . 1998. The Branching Factor of Regular Search Space . In Proceedings of the 15th National Conference on Artificial Intelligence. Association for Advancement of Artificial Intelligence , Palo Alto, CA, 299--304. Stefan Edelkamp and Richard E. Korf. 1998. The Branching Factor of Regular Search Space. In Proceedings of the 15th National Conference on Artificial Intelligence. Association for Advancement of Artificial Intelligence, Palo Alto, CA, 299--304."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00184-Z"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01053799"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1562164.1562186"},{"volume-title":"NP, and the Search for the Impossible","author":"Fortnow Lance","key":"e_1_3_2_1_14_1","unstructured":"Lance Fortnow . 2013. The Golden Ticket - P , NP, and the Search for the Impossible . Princeton University Press , Princeton, NJ, USA . Lance Fortnow. 2013. The Golden Ticket - P, NP, and the Search for the Impossible. Princeton University Press, Princeton, NJ, USA."},{"key":"e_1_3_2_1_15_1","volume-title":"Johnson","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S . Johnson . 1979 . Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman , San Francisco, CA, USA. Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, CA, USA."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(92)90049-9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01212280"},{"volume-title":"Collected Papers of John Milnor VI: Dynamical Systems (1953-2000)","author":"Milnor John","key":"e_1_3_2_1_19_1","unstructured":"John Milnor . 2010. Collected Papers of John Milnor VI: Dynamical Systems (1953-2000) . American Mathematical Society , Providence, RI, USA . John Milnor. 2010. Collected Papers of John Milnor VI: Dynamical Systems (1953-2000). American Mathematical Society, Providence, RI, USA."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206005"},{"key":"e_1_3_2_1_21_1","volume-title":"Papadimitriou and Kenneth Steiglitz","author":"Christos","year":"1998","unstructured":"Christos H. Papadimitriou and Kenneth Steiglitz . 1998 . Combinatorial Optimization : Algorithms and Complexity. Dover Publications , New York, NY, USA. Christos H. Papadimitriou and Kenneth Steiglitz. 1998. Combinatorial Optimization: Algorithms and Complexity. Dover Publications, New York, NY, USA."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/358589.358616"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129771"}],"event":{"name":"ACM SE '22: 2022 ACM Southeast Conference","sponsor":["ACM Association for Computing Machinery"],"location":"Virtual Event","acronym":"ACM SE '22"},"container-title":["Proceedings of the ACM Southeast Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476883.3524046","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3476883.3524046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:45Z","timestamp":1750188645000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476883.3524046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,18]]},"references-count":22,"alternative-id":["10.1145\/3476883.3524046","10.1145\/3476883"],"URL":"https:\/\/doi.org\/10.1145\/3476883.3524046","relation":{},"subject":[],"published":{"date-parts":[[2022,4,18]]}}}