{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:12Z","timestamp":1750309332740,"version":"3.41.0"},"reference-count":120,"publisher":"Association for Computing Machinery (ACM)","issue":"9","license":[{"start":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T00:00:00Z","timestamp":1713916800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2024,10,31]]},"abstract":"<jats:p>This tutorial presents a novel search system\u2014the Attractor-Based Search System (ABSS)\u2014that can solve the Traveling Salesman Problem very efficiently with optimality guarantee. From the perspective of dynamical systems, a heuristic local search algorithm for an NP-complete combinatorial problem is a discrete dynamical system. In a local search system, an attractor drives the search trajectories into the vicinity of a globally optimal point in the solution space, and the convergence of local search trajectories makes the search system become a global and deterministic system. The attractor contains a small set of the most promising solutions to the problem. The attractor can reduce the problem size exponentially, and thus make the exhaustive search feasible. Therefore, this new search paradigm is called optimizing with attractor. The ABSS consists of two search phases: local search phase and exhaustive search phase. The local search process is used to quickly construct the attractor in the solution space, and the exhaustive search process is used to completely search the attractor to identify the optimal solution. Therefore, the exact optimal solution can be found quickly by combining local search and exhaustive search. This tutorial introduces the concept of an attractor in a local search system, and describes the process of optimizing with the attractor, using the Traveling Salesman Problem as the study platform.<\/jats:p>","DOI":"10.1145\/3648354","type":"journal-article","created":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T11:56:32Z","timestamp":1707998192000},"page":"1-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing with Attractor: A Tutorial"],"prefix":"10.1145","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0739-6859","authenticated-orcid":false,"given":"Weiqi","family":"Li","sequence":"first","affiliation":[{"name":"University of Michigan, Flint, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,4,24]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"crossref","DOI":"10.1515\/9780691187563","volume-title":"Local Search in Combinatorial Optimization","author":"Aarts Emile H. L.","year":"2003","unstructured":"Emile H. L. Aarts and Jan K. Lenstra. 2003. Local Search in Combinatorial Optimization. Princeton University Press, Princeton."},{"key":"e_1_3_1_3_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59281-2","volume-title":"Chaos: Introduction to Dynamical Systems","author":"Alligood Kathleen T.","year":"1997","unstructured":"Kathleen T. Alligood, Tim D. Sauer, and James A. Yorke. 1997. Chaos: Introduction to Dynamical Systems. Springer, New York."},{"key":"e_1_3_1_4_2","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"Applegate David L.","year":"2006","unstructured":"David L. Applegate, Robert E. Bixby, Va\u0161ek Chv\u00e1tal, and William J. Cook. 2006. The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton, NJ, USA."},{"key":"e_1_3_1_5_2","unstructured":"David L. Applegate Robert E. Bixby Va\u0161ek Chv\u00e1tal and William J. Cook. Concorde website. (March 2015). Retrieved November 15 2023 from https:\/\/www.math.uwaterloo.ca\/tsp\/concorde\/index.html"},{"key":"e_1_3_1_6_2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"Arora Sanjeev","year":"2009","unstructured":"Sanjeev Arora and Boaz Barak. 2009. Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge."},{"key":"e_1_3_1_7_2","author":"Auslander J.","year":"1964","unstructured":"J. Auslander, N. P. Bhatia, and P. Seibert. 1964. Attractor in Dynamical Systems. NASA Technical Report NASA-CR-59858.","journal-title":"Attractor in Dynamical Systems"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(78)80011-3"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0199-8"},{"key":"e_1_3_1_10_2","volume-title":"Mathematics for Dynamic Modeling","author":"Beltrami Edward J.","year":"1998","unstructured":"Edward J. Beltrami. 1998. Mathematics for Dynamic Modeling. Academic Press, San Diego."},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2007.892762"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/937503.937505"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377\/(94)90065-5"},{"key":"e_1_3_1_14_2","volume-title":"Introduction to Dynamical Systems","author":"Brin Michael","year":"2016","unstructured":"Michael Brin and Garrett Stuck. 2016. Introduction to Dynamical Systems. Cambridge University Press, Cambridge."},{"key":"e_1_3_1_15_2","first-page":"1198","volume-title":"Proceedings of the 22nd International Conference on Artificial Intelligence","volume":"2","author":"Bringmann Karl","year":"2011","unstructured":"Karl Bringmann, Tobias Friedrich, Frank Neumann, and Markus Wagner. 2011. Approximation-guided evolutionary multi-objective optimization. In Proceedings of the 22nd International Conference on Artificial Intelligence, Vol. 2, 1198\u20131203. https:\/\/doi.org\/10.5591\/978-1-57735-516-8\/IJCAI11-204"},{"key":"e_1_3_1_16_2","volume-title":"A Modern Introduction to Dynamical Systems","author":"Brown Richard J.","year":"2018","unstructured":"Richard J. Brown. 2018. A Modern Introduction to Dynamical Systems. Oxford University Press, Oxford."},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251244"},{"key":"e_1_3_1_18_2","volume-title":"Evolutionary Algorithms for Solving Multi-Objective Problems","author":"Coello Carlos A. Coello","year":"2007","unstructured":"Carlos A. Coello Coello, Gary B. Lamont, and David A. Van Veldhuisen. 2007. Evolutionary Algorithms for Solving Multi-Objective Problems. Springer, Berlin."},{"key":"e_1_3_1_19_2","volume-title":"Multiobjective Programming and Planning","author":"Cohon Jared L.","year":"2004","unstructured":"Jared L. Cohon. 2004. Multiobjective Programming and Planning. Courier Dover Publications, Mineola."},{"key":"e_1_3_1_20_2","unstructured":"Stephen Cook. 2022. The P versus NP Problem. Clay Mathematics Institute. http:\/\/www.claymath.org\/sites\/default\/files\/pvsnp.pdf"},{"key":"e_1_3_1_21_2","volume-title":"In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation","author":"Cook William","year":"2012","unstructured":"William Cook. 2012. In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton."},{"key":"e_1_3_1_22_2","volume-title":"Combinatorial Optimization","author":"Cook William","year":"1998","unstructured":"William Cook, William H. Cunningham, William R. Pulleyblank, and Alexander Schrijver. 1998. Combinatorial Optimization. John Wiley & Sons, New York."},{"key":"e_1_3_1_23_2","volume-title":"Introduction to Algorithms","author":"Cormen Thomas","year":"2001","unstructured":"Thomas Cormen. 2001. Introduction to Algorithms. MIT Press, Cambridge."},{"key":"e_1_3_1_24_2","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","year":"2009","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms. MIT Press, Cambridge."},{"key":"e_1_3_1_25_2","volume-title":"New Ideas in Optimization","author":"Corne David","year":"1999","unstructured":"David Corne, Marco Dorigo, and Fred Glover. 1999. New Ideas in Optimization. McGraw-Hill, London."},{"key":"e_1_3_1_26_2","volume-title":"Elements of Information Theory","author":"Cover Thomas M.","year":"2006","unstructured":"Thomas M. Cover and Joy A. Thomas. 2006. Elements of Information Theory. Wiley, New York."},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.13232\/ejgtcle.2011"},{"key":"e_1_3_1_29_2","volume-title":"Optimization, Learning and Natural Algorithms","author":"Dorigo Marco","year":"1992","unstructured":"Marco Dorigo. 1992. Optimization, Learning and Natural Algorithms. Ph.D. Thesis, Dip Electronica e Informazione, Politecnico Di Milano, Italy."},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"e_1_3_1_31_2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"Dorigo Marco","year":"2004","unstructured":"Marco Dorigo and Thomas St\u00fctzle. 2004. Ant Colony Optimization. The MIT Press, Cambridge."},{"key":"e_1_3_1_32_2","volume-title":"Theory of Computational Complexity","author":"Du Ding-Zhu","year":"2000","unstructured":"Ding-Zhu Du and Ker-l Ko. 2000. Theory of Computational Complexity. John Wiley & Sons, New York."},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-74759-0_268"},{"key":"e_1_3_1_34_2","first-page":"292","volume-title":"Proceedings of the 15thNational Conference on Artificial Intelligence","author":"Edelkamp Stefan","year":"1998","unstructured":"Stefan Edelkamp and Richard E. Korf. 1998. The branching factor of regular search space. In Proceedings of the 15thNational Conference on Artificial Intelligence. 292\u2013304."},{"key":"e_1_3_1_35_2","volume-title":"Multicriteria Optimization","author":"Ehrgott Matthias","year":"2005","unstructured":"Matthias Ehrgott. 2005. Multicriteria Optimization (2nd ed.). Springer, New York.","edition":"2"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90002-3"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00184-Z"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.34.3.263"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/1562164\/1562186"},{"key":"e_1_3_1_41_2","volume-title":"The Golden Ticket\u2014P, NP, and the Search for the Impossible","author":"Fortnow Lance","year":"2013","unstructured":"Lance Fortnow. 2013. The Golden Ticket\u2014P, NP, and the Search for the Impossible. Princeton University Press. Princeton."},{"key":"e_1_3_1_42_2","doi-asserted-by":"crossref","DOI":"10.1002\/9781119387596","volume-title":"Markov Chains: From Theory to Implementation and eExperimentation","author":"Gagniuc Paul A.","year":"2017","unstructured":"Paul A. Gagniuc. 2017. Markov Chains: From Theory to Implementation and eExperimentation. John Wiley & Sons, New York."},{"key":"e_1_3_1_43_2","volume-title":"Information Theory and Reliable Communication","author":"Gallager Robert G.","year":"1991","unstructured":"Robert G. Gallager. 1991. Information Theory and Reliable Communication. Wiley, New York."},{"key":"e_1_3_1_44_2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freemen and Company, New York."},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.2307\/3010508"},{"key":"e_1_3_1_47_2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804106","volume-title":"Computational Complexity: A Conceptual Perspective","author":"Goldreich Oded","year":"2008","unstructured":"Oded Goldreich. 2008. Computational Complexity: A Conceptual Perspective. Cambridge University Press, Cambridge."},{"key":"e_1_3_1_48_2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511761355","volume-title":"P, NP, and NP-Completeness","author":"Goldreich Oded","year":"2010","unstructured":"Oded Goldreich. 2010. P, NP, and NP-Completeness. Cambridge University Press, Cambridge."},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.09.012"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.50.346"},{"key":"e_1_3_1_51_2","doi-asserted-by":"crossref","DOI":"10.1007\/b101971","volume-title":"The Traveling Salesman Problem and Its Variations","author":"Gutin Gregory","year":"2007","unstructured":"Gregory Gutin and Abraham P. Punnen. 2007. The Traveling Salesman Problem and Its Variations. Springer, New York, NY."},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3313"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2010.116"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/321650.321661"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.2307\/2334940"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59242-4-3"},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0004-6"},{"key":"e_1_3_1_59_2","volume-title":"Topics in Algebra","author":"Herstein Israel N.","year":"1964","unstructured":"Israel N. Herstein. 1964. Topics in Algebra. Blaisdell Publishing Company, Waltham, MA."},{"key":"e_1_3_1_60_2","volume-title":"Stochastic Local Search: Foundations and Applications","author":"Hoos Holger H.","year":"2004","unstructured":"Holger H. Hoos and Thomas St\u0171tzle. 2004. Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, New York."},{"key":"e_1_3_1_61_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-2025-2","volume-title":"Handbook of Global Optimization: Nonconvex Optimization and Its Application","author":"Horst Reiner","year":"1995","unstructured":"Reiner Horst and Panos M. Pardalos. 1995. Handbook of Global Optimization: Nonconvex Optimization and Its Application. Springer, New York."},{"key":"e_1_3_1_62_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0015-5","volume-title":"Introduction to Global Optimization: Nonconvex Optimization and Its Applications","author":"Horst Reiner","year":"2000","unstructured":"Reiner Horst, Panos M. Pardalos, and Nguyen V. Thoai. 2000. Introduction to Global Optimization: Nonconvex Optimization and Its Applications. Springer, New York."},{"key":"e_1_3_1_63_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0032050"},{"key":"e_1_3_1_64_2","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48213-4_9"},{"issue":"8","key":"e_1_3_1_65_2","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1051\/jphys:019850046080127700","article-title":"Configuration space analysis of traveling salesman problems","volume":"46","author":"Kirkpatrick Scott","year":"1985","unstructured":"Scott Kirkpatrick and G\u00e9rard Toulouse. 1985. Configuration space analysis of traveling salesman problems. Journal de Physique 46, 8 (1985), 1277\u20131292. jphys:019850046080127700","journal-title":"Journal de Physique"},{"key":"e_1_3_1_66_2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511760303","volume-title":"Nonlinear Markov Process and Kinetic Equations","author":"Kolokoltsov Vassilli N.","year":"2010","unstructured":"Vassilli N. Kolokoltsov. 2010. Nonlinear Markov Process and Kinetic Equations. Cambridge University Press, Cambridge."},{"key":"e_1_3_1_67_2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"e_1_3_1_68_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-56039-6","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"Korte Bernhard","year":"2018","unstructured":"Bernhard Korte and Jens Vygen. 2018. Combinatorial Optimization: Theory and Algorithms. Springer, New York."},{"key":"e_1_3_1_69_2","doi-asserted-by":"crossref","DOI":"10.1002\/9781118014967","volume-title":"Handbook of Monte Carlo Methods","author":"Kroese Dirk P.","year":"2011","unstructured":"Dirk P. Kroese, Thomas Taimre, and Zdravko I. Botev. 2011. Handbook of Monte Carlo Methods. John Wiley & Sons, New York."},{"key":"e_1_3_1_70_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.1.44"},{"key":"e_1_3_1_71_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-5945-4_15"},{"key":"e_1_3_1_72_2","volume-title":"The Traveling Salesman Problems: A Guided Tour of Combinatorial Optimization","author":"Lawler Eugene L.","year":"1985","unstructured":"Eugene L. Lawler, Jan K. Lenstra, Alexander Rinnooy-Kan, and David Shmoys. 1985. The Traveling Salesman Problems: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, New York."},{"key":"e_1_3_1_73_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"key":"e_1_3_1_74_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"e_1_3_1_75_2","volume-title":"Niching Methods for Genetic Algorithms","author":"Mahfoud Samir W.","year":"1996","unstructured":"Samir W. Mahfoud. 1996. Niching Methods for Genetic Algorithms. University of Illinois Press, Champaign."},{"key":"e_1_3_1_76_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07153-4_1-1"},{"key":"e_1_3_1_77_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665\u20135_9"},{"key":"e_1_3_1_78_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.10.012"},{"key":"e_1_3_1_79_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(92)90028-2"},{"key":"e_1_3_1_80_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-2864-4_182"},{"key":"e_1_3_1_81_2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511626630","volume-title":"Markov Chains and Stochastic Stability","author":"Meyn Sean","year":"2009","unstructured":"Sean Meyn and Richard L. Tweedie. 2009. Markov Chains and Stochastic Stability. Cambridge University Press, Cambridge."},{"key":"e_1_3_1_82_2","doi-asserted-by":"publisher","DOI":"10.1051\/jphys:019860047080128500"},{"key":"e_1_3_1_83_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07807-5","volume-title":"How to Solve It: Modern Heuristics","author":"Michalewicz Zbigniew","year":"2004","unstructured":"Zbigniew Michalewicz and David B. Fogel. 2004. How to Solve It: Modern Heuristics. Springer, Berlin."},{"key":"e_1_3_1_84_2","doi-asserted-by":"crossref","DOI":"10.1201\/9780203908297","volume-title":"Qualitative Theory of Dynamical Systems","author":"Michel Anthony N.","year":"2001","unstructured":"Anthony N. Michel, Kaining Wang, and Bo Hu. 2001. Qualitative Theory of Dynamical Systems. Marcel Dekker, New York."},{"key":"e_1_3_1_85_2","volume-title":"Nonlinear Multiobjective Optimization","author":"Miettinen Kaisa","year":"1999","unstructured":"Kaisa Miettinen. 1999. Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, Bordrecht."},{"key":"e_1_3_1_86_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01212280"},{"key":"e_1_3_1_87_2","volume-title":"Collected Papers of John Milnor VI: Dynamical Systems (1953\u20132000)","author":"Milnor John","year":"2010","unstructured":"John Milnor. 2010. Collected Papers of John Milnor VI: Dynamical Systems (1953\u20132000). American Mathematical Society, Providence."},{"key":"e_1_3_1_88_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(03)00130-8"},{"key":"e_1_3_1_89_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijor.1120.0506"},{"key":"e_1_3_1_90_2","volume-title":"Artificial Ants","author":"Nicolas Monmarch\u00e9","year":"2010","unstructured":"Monmarch\u00e9 Nicolas, Guinand Fr\u00e9d\u00e9ric, and Siarry Patrick. 2010. Artificial Ants. Wiley, New York."},{"key":"e_1_3_1_91_2","volume-title":"Proceedings of Evolutionary Computation in Combinatorial Optimization (EvoCOP \u201916).","volume":"9595","author":"Ochoa Gabriela","year":"2016","unstructured":"Gabriela Ochoa and Nadarajen Veerapen. 2016. Deconstructing the big valley search space hypothesis. In Proceedings of Evolutionary Computation in Combinatorial Optimization (EvoCOP \u201916). Lecture Notes in Computer Science, Vol. 9595. Springer. 10.1007\/978-3-319-30698-8_5"},{"key":"e_1_3_1_92_2","volume-title":"Computational Complexity","author":"Papadimitriou Christos H.","year":"1993","unstructured":"Christos H. Papadimitriou. 1993. Computational Complexity. Pearson, New York."},{"key":"e_1_3_1_93_2","doi-asserted-by":"publisher","DOI":"10.1137\/0206005"},{"key":"e_1_3_1_94_2","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou Christos H.","year":"1999","unstructured":"Christos H. Papadimitriou and Kenneth Steiglitz. 1999. Combinatorial Optimization: Algorithms and Complexity. Dover Publications, New York."},{"key":"e_1_3_1_95_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5362-2","volume-title":"Handbook of Global Optimization Volume 2: Nonconvex Optimization and Its Application","author":"Pardalos Panos M.","year":"2002","unstructured":"Panos M. Pardalos and H. Edwin Romeijn. 2002. Handbook of Global Optimization Volume 2: Nonconvex Optimization and Its Application. Springer, New York."},{"key":"e_1_3_1_96_2","doi-asserted-by":"publisher","DOI":"10.1145\/358589.358616"},{"key":"e_1_3_1_97_2","volume-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"Pearl Judea","year":"1984","unstructured":"Judea Pearl. 1984. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, New York."},{"key":"e_1_3_1_98_2","volume-title":"An Introduction to Binary Search Trees and Balanced Trees","author":"Pfaff Ben","year":"2004","unstructured":"Ben Pfaff. 2004. An Introduction to Binary Search Trees and Balanced Trees. Free Software Foundation, Inc., Boston."},{"key":"e_1_3_1_99_2","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"Reeves Colin R.","year":"1993","unstructured":"Colin R. Reeves. 1993. Modern Heuristic Techniques for Combinatorial Problems. John Wiley & Sons, New York."},{"key":"e_1_3_1_100_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018983524911"},{"key":"e_1_3_1_101_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.09.010"},{"key":"e_1_3_1_102_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.05.011"},{"key":"e_1_3_1_103_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5_10"},{"key":"e_1_3_1_104_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4939-6530-4","volume-title":"Optimization by GRASP","author":"Resende Mauricio G. C.","year":"2016","unstructured":"Mauricio G. C. Resende and Celso C. Ribeiro. 2016. Optimization by GRASP. Springer, New York."},{"key":"e_1_3_1_105_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-6530-4__8"},{"key":"e_1_3_1_106_2","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321975"},{"key":"e_1_3_1_107_2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/3071178.3071304","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO \u201917)","author":"Sanches Danilo","year":"2017","unstructured":"Danilo Sanches, Darrell Whitley, and Renato Tin\u00f3s. 2017. Improving an exact solver for the traveling salesman problem using partition crossover. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO \u201917). 337\u2013344. 10.1145\/3071178.3071304"},{"key":"e_1_3_1_108_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580681"},{"key":"e_1_3_1_109_2","volume-title":"Stochastic Optimization","author":"Schneider Johannes J.","year":"2006","unstructured":"Johannes J. Schneider and Scott Kirkpatrick. 2006. Stochastic Optimization. Springer, New York."},{"key":"e_1_3_1_110_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"e_1_3_1_111_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92910-9_32"},{"key":"e_1_3_1_112_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-011-9250-4"},{"key":"e_1_3_1_113_2","first-page":"603","volume-title":"Proceedings of the 24th Annual ACM Symposium on Theory of Computing","author":"Sipser Michael","year":"1992","unstructured":"Michael Sipser. 1992. The history and status of the P verses NP question. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing. 603\u2013618. 10.1145\/129712.129771"},{"key":"e_1_3_1_114_2","volume-title":"Introduction to the Theory of Computation","author":"Sipser Michael","year":"2006","unstructured":"Michael Sipser. 2006. Introduction to the Theory of Computation. Thomson Course Technology, Boston."},{"key":"e_1_3_1_115_2","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/2\/12\/006"},{"key":"e_1_3_1_116_2","doi-asserted-by":"publisher","DOI":"10.1109\/21.281425"},{"key":"e_1_3_1_117_2","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"Talbi El-Ghazali","year":"2009","unstructured":"El-Ghazali Talbi. 2009. Metaheuristics: From Design to Implementation. Wiley, New York."},{"key":"e_1_3_1_118_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90412-8"},{"key":"e_1_3_1_119_2","volume-title":"Stochastic Global Optimization","author":"Zhigljavaky Anatoly","year":"2008","unstructured":"Anatoly Zhigljavaky and Antanas \u017dilinskas. 2008. Stochastic Global Optimization. Springer, New York."},{"key":"e_1_3_1_120_2","volume-title":"Handbook of Multicriteria Analysis (Applied Optimization, 103)","author":"Zopouniclis Constantin","year":"2010","unstructured":"Constantin Zopouniclis and Panos M. Pardalos. 2010. Handbook of Multicriteria Analysis (Applied Optimization, 103). Springer, New York."},{"key":"e_1_3_1_121_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.6.1049"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3648354","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3648354","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:13Z","timestamp":1750291453000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3648354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,24]]},"references-count":120,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,10,31]]}},"alternative-id":["10.1145\/3648354"],"URL":"https:\/\/doi.org\/10.1145\/3648354","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"type":"print","value":"0360-0300"},{"type":"electronic","value":"1557-7341"}],"subject":[],"published":{"date-parts":[[2024,4,24]]},"assertion":[{"value":"2022-11-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-31","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-04-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}