{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T19:58:22Z","timestamp":1773777502102,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4915,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1016\/s0166-218x(99)00138-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"261-277","source":"Crossref","is-referenced-by-count":36,"title":["On the classification of NP-complete problems in terms of their correlation coefficient"],"prefix":"10.1016","volume":"99","author":[{"given":"Eric","family":"Angel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis","family":"Zissimopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00138-9_BIB1","unstructured":"E. Aarts, J. Korst, Simulated Annealing and Boltzman Machines: a Stochastic Approach to Combinatorial Optimization and Neural Computing, Wiley, New York, 1989."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB2","unstructured":"E. Angel, V. Zissimopoulos, Towards a classification of combinatorial optimization problems relatively to their difficulty for generalized local search algorithms, Technical Report 1112, LRI, Universit\u00e9 de Paris-Sud, 1997."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0304-3975(97)00176-X","article-title":"Autocorrelation coefficient for the graph bipartitioning problem","volume":"191","author":"Angel","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB4","unstructured":"E. Angel, V. Zissimopoulos, On the landscape ruggedness of the quadratic assignment problem, Technical Report 98-02, Universit\u00e9 de Paris-Nord, LIPN, Institut Galil\u00e9e, 1998."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0166-218X(97)00129-7","article-title":"On the quality of local search for the quadratic assignment problem","volume":"82","author":"Angel","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB6","first-page":"289","article-title":"Binary sequences with a maximally flat amplitude spectrum","volume":"40","author":"Beenker","year":"1985","journal-title":"Philips J. Res."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","article-title":"A thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm","volume":"45","author":"\u010cerny","year":"1985","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB8","doi-asserted-by":"crossref","unstructured":"B. Codenotti, L. Margara, Local properties of some NP-complete problems, Technical Report TR-92-021, International computer science institute, Berkeley, CA 94704, April 1992.","DOI":"10.1016\/0893-9659(92)90090-V"},{"key":"10.1016\/S0166-218X(99)00138-9_BIB9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","article-title":"An improved annealing scheme for the qap","volume":"46","author":"Connolly","year":"1990","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB10","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees, and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Can. J. Math."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB11","doi-asserted-by":"crossref","unstructured":"M.A. Fleischer, Generalized cybernetic optimization: solving continuous variable problems, in second International Conference on Metaheuristics, Sophia-Antipolis, France, July 21\u201324, 1997.","DOI":"10.1007\/978-1-4615-5775-3_28"},{"key":"10.1016\/S0166-218X(99)00138-9_BIB12","doi-asserted-by":"crossref","unstructured":"F.W. Glover, M. Laguna, Tabu Search, Kluwer Academic Publishers, Dordrecht, 1997.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"10.1016\/S0166-218X(99)00138-9_BIB13","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0167-6377(92)90049-9","article-title":"Local search and the local structure of NP-complete problems","volume":"12","author":"K. Grover","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB14","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","article-title":"Cooling schedules for optimal annealing","volume":"13","author":"Hajek","year":"1987","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB15","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, Local optimization and the traveling salesman problem, ICALP 90 Automata, Languages and Programming, 1990, pp. 446\u2013461.","DOI":"10.1007\/BFb0032050"},{"issue":"6","key":"10.1016\/S0166-218X(99)00138-9_BIB16","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: an experimental evaluation; Part I, Graph partitioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB17","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","article-title":"Optimization by simulated annealing: an experimental evaluation; Part II, Graph coloring and number partitioning","volume":"39","author":"Johnson","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB18","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(93)90003-7","article-title":"On the depth of combinatorial optimization problems","volume":"43","author":"Kern","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01582166","article-title":"Convergence of an annealing algorithm","volume":"34","author":"Lundy","year":"1986","journal-title":"Math. Program."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB20","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/0377-2217(93)E0128-K","article-title":"Algodesk: an experimental comparison of eight evolutionary heuristics for the quadratic assignment problem","volume":"81","author":"Maniezzo","year":"1995","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB21","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0166-218X(93)E0134-K","article-title":"The depth and width of local minima in discrete solution spaces","volume":"56","author":"Ryan","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB22","unstructured":"P.F. Stadler, Landscapes and their correlation functions, Technical Report 95-07-067, Santa Fe institute, Santa Fe, NM, 1995."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB23","unstructured":"P.F. Stadler, Towards a theory of landscapes, Technical Report 95-03-030, Santa Fe Institute, Santa Fe, NM, 1995."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB24","unstructured":"P.F. Stadler, R. Happel, Canonical approximation of landscapes, Technical Report 94-09-051, Santa Fe institute, Santa Fe, NM, 1994."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB25","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00202749","article-title":"Correlated and uncorrelated fitness landscapes and how to tell the difference","volume":"63","author":"Weinberger","year":"1990","journal-title":"Biol. Cybernet."},{"key":"10.1016\/S0166-218X(99)00138-9_BIB26","unstructured":"E.D. Weinberger, NP-completeness of Kauffman's N\u2013k model: a tunably rugged energy landscape, Technical Report 96-02-003, Santa Fe Institute, Santa Fe, NM, 1996."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001389?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001389?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T11:46:25Z","timestamp":1579002385000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":26,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0166218X99001389"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00138-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}