Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference4 articles.
1. The complexity of theorem-proving procedures;Cook,1971
2. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
3. How easy is local search;Johnson;J. Comput. System Sci.,1988
4. Some examples of difficult traveling salesman problems;Papdimitriou;Oper. Res.,1978
Cited by
94 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. SoK: quantum computing methods for machine learning optimization;Quantum Machine Intelligence;2024-07-24
2. New Knowledge about the Elementary Landscape Decomposition for Solving the Quadratic Assignment Problem;Proceedings of the Genetic and Evolutionary Computation Conference;2023-07-12
3. Analysis of the Attractor-Based Search System;The Traveling Salesman Problem;2023-07-09
4. Virus Evolution on Fitness Landscapes;Current Topics in Microbiology and Immunology;2023
5. Local optima organize into lattices under recombination;Proceedings of the Genetic and Evolutionary Computation Conference;2022-07-08