{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T06:58:35Z","timestamp":1763017115532,"version":"build-2065373602"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10732-011-9170-6","type":"journal-article","created":{"date-parts":[[2011,5,31]],"date-time":"2011-05-31T19:59:04Z","timestamp":1306871944000},"page":"711-728","source":"Crossref","is-referenced-by-count":11,"title":["Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization"],"prefix":"10.1007","volume":"19","author":[{"given":"Francisco","family":"Chicano","sequence":"first","affiliation":[]},{"given":"Enrique","family":"Alba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,1]]},"reference":[{"key":"9170_CR1","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/00207729408928968","volume":"25","author":"B. Alidaee","year":"1994","unstructured":"Alidaee, B., Kochenberger, G., Ahmadian, A.: 0-1 quadratic programming approach for the optimal solution of two scheduling problems. Int. J. Syst. Sci. 25, 401\u2013408 (1994)","journal-title":"Int. J. Syst. Sci."},{"key":"9170_CR2","volume-title":"New Ideas in Optimisation","author":"M.M. Amini","year":"1999","unstructured":"Amini, M.M., Alidaee, B., Kochenberger, G. New Ideas in Optimisation. McGraw-Hill, London (1999). Chap.\u00a0A Scatter Search Approach to Unconstrained Quadratic Binary Programs, pp\u00a0317\u2013329"},{"key":"9170_CR3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0304-3975(97)00176-X","volume":"191","author":"E. Angel","year":"1998","unstructured":"Angel, E., Zissimopoulos, V.: Autocorrelation coefficient for the graph bipartitioning problem. Theor. Comput. Sci. 191, 229\u2013243 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"9170_CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0166-218X(99)00138-9","volume":"99","author":"E. Angel","year":"2000","unstructured":"Angel, E., Zissimopoulos, V.: On the classification of NP-complete problems in terms of their correlation coefficient. Discrete Appl. Math. 99, 261\u2013277 (2000a)","journal-title":"Discrete Appl. Math."},{"key":"9170_CR5","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0304-3975(00)00239-5","volume":"263","author":"E. Angel","year":"2000","unstructured":"Angel, E., Zissimopoulos, V.: On the landscape ruggedness of the quadratic assignment problem. Theor. Comput. Sci. 263, 159\u2013172 (2000b)","journal-title":"Theor. Comput. Sci."},{"key":"9170_CR6","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-73510-6","volume-title":"Laplacian Eigenvectors of Graphs","author":"T. Biyikoglu","year":"2007","unstructured":"Biyikoglu, T., Leyold, J., Stadler, P.F.: Laplacian Eigenvectors of Graphs. Lecture Notes in Mathematics. Springer, Berlin (2007)"},{"issue":"4","key":"9170_CR7","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/mnsc.41.4.704","volume":"41","author":"P. Chartaire","year":"1994","unstructured":"Chartaire, P., Sutter, A.: A decomposition method for quadratic 0-1 minimization. Manag. Sci. 41(4), 704\u2013712 (1994)","journal-title":"Manag. Sci."},{"key":"9170_CR8","unstructured":"Codenotti, B., Margara, L.: Local properties of some NP-complete problems. Tech. Rep. TR 92-021, International Computer Science Institute, Berkeley, USA (1992)"},{"key":"9170_CR9","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0120892","volume":"12","author":"G. Gallo","year":"1980","unstructured":"Gallo, G., Hammer, P., Simeone, B.: Quadratic knapsack problems. Math. Program. 12, 132\u2013149 (1980)","journal-title":"Math. Program."},{"issue":"2\u20134","key":"9170_CR10","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/S0167-2789(97)00091-2","volume":"107","author":"R. Garc\u00eda-Pelayo","year":"1997","unstructured":"Garc\u00eda-Pelayo, R., Stadler, P.: Correlation length, isotropy and meta-stable states. Physica D 107(2\u20134), 240\u2013254 (1997)","journal-title":"Physica D"},{"key":"9170_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"issue":"2","key":"9170_CR12","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(01)00209-0","volume":"137","author":"F. Glover","year":"2002","unstructured":"Glover, F., Alidaee, B., Rego, C., Kochenberger, G.: One-pass heuristics for large-scale unconstrained binary quadratic problems. Eur. J. Oper. Res. 137(2), 272\u2013287 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"9170_CR13","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0167-6377(92)90049-9","volume":"12","author":"L.K. Grover","year":"1992","unstructured":"Grover, L.K.: Local search and the local structure of NP-complete problems. Oper. Res. Lett. 12, 235\u2013243 (1992)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"9170_CR14","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1307\/mmj\/1028989917","volume":"2","author":"F. Harary","year":"1953","unstructured":"Harary, F.: On the notion of balanced of a signed graphs. Mich. Math. J. 2(2), 143\u2013146 (1953)","journal-title":"Mich. Math. J."},{"key":"9170_CR15","first-page":"183","volume-title":"FOGA","author":"R.B. Heckendorn","year":"1998","unstructured":"Heckendorn, R.B., Rana, S.B., Whitley, L.D.: Test function generators as embedded landscapes. In: Banzhaf, W., Reeves, C.R. (eds.) FOGA, pp.\u00a0183\u2013198. Morgan Kaufmann, San Mateo (1998)"},{"key":"9170_CR16","first-page":"291","volume":"82","author":"C. Helmberg","year":"1998","unstructured":"Helmberg, C., Rendl, F.: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes. Math. Program. 82, 291\u2013315 (1998)","journal-title":"Math. Program."},{"key":"9170_CR17","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0377-2217(00)00242-3","volume":"134","author":"K. Katayama","year":"2001","unstructured":"Katayama, K., Narihisa, H.: Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem. Eur. J. Oper. Res. 134, 103\u2013119 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9170_CR18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0120827","volume":"9","author":"J. Krarup","year":"1978","unstructured":"Krarup, J., Pruzan, A.: Computer aided layout design. Math. Program. Stud. 9, 75\u201394 (1978)","journal-title":"Math. Program. Stud."},{"key":"9170_CR19","unstructured":"Liu, W., Wilkins, D., Alidaee, B.: A hybrid multi-exchange local search for unconstrained binary quadratic program. Tech. Rep. HCES-09-05, Hearin Center for Enterprise Science, University of Mississippi (2005)"},{"key":"9170_CR20","volume-title":"Proceedings of the 2nd International Symposium on Search Based Software Engineering (SSBSE)","author":"G. Lu","year":"2010","unstructured":"Lu, G., Bahsoon, R., Yao, X.: Applying elementary landscape analysis to search-based software engineering. In: Proceedings of the 2nd International Symposium on Search Based Software Engineering (SSBSE) (2010)"},{"key":"9170_CR21","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/mnsc.26.3.282","volume":"26","author":"R.D. McBride","year":"1980","unstructured":"McBride, R.D., Yormack, J.S.: An implicit enumeration algorithm for quadratic integer programming. Manag. Sci. 26, 282\u2013296 (1980)","journal-title":"Manag. Sci."},{"issue":"2","key":"9170_CR22","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1017912624016","volume":"8","author":"P. Merz","year":"2002","unstructured":"Merz, P., Freisleben, B.: Greedy and local search heuristics for unconstrained binary quadratic programming. J. Heuristics 8(2), 197\u2013213 (2002)","journal-title":"J. Heuristics"},{"issue":"1\u20133","key":"9170_CR23","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.biosystems.2004.08.002","volume":"78","author":"P. Merz","year":"2004","unstructured":"Merz, P., Katayama, K.: Memetic algorithms for the unconstrained binary quadratic programming problem. Biosystems 78(1\u20133), 99\u2013118 (2004)","journal-title":"Biosystems"},{"key":"9170_CR24","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/B:ANOR.0000039522.58036.68","volume":"131","author":"G. Palubeckis","year":"2004","unstructured":"Palubeckis, G.: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem. Ann. Oper. Res. 131, 259\u2013282 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"9170_CR25","first-page":"14","volume":"24","author":"G. Palubeckis","year":"2002","unstructured":"Palubeckis, G., Tomkevi\u00e8ius, A.: Grasp implementations for the uncostrained binary quadratic optimization problem. Inf. Technol. Control 24(3), 14\u201320 (2002)","journal-title":"Inf. Technol. Control"},{"key":"9170_CR26","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01096724","volume":"4","author":"A.T. Philips","year":"1994","unstructured":"Philips, A.T., Rosen, J.B.: A quadratic assignment formulation of the molecular conformation problem. J. Glob. Optim. 4, 229\u2013241 (1994)","journal-title":"J. Glob. Optim."},{"key":"9170_CR27","first-page":"77","volume-title":"Complex Systems and Binary Networks","author":"P.F. Stadler","year":"1995","unstructured":"Stadler, P.F.: Toward a theory of landscapes. In: L\u00f3pez-Pe\u00f1a, R., Capovilla, R., Garc\u00eda-Pelayo, R., Waelbroeck, H., Zertruche, F. (eds.) Complex Systems and Binary Networks, pp.\u00a077\u2013163. Springer, Berlin (1995)"},{"key":"9170_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01165154","volume":"20","author":"P.F. Stadler","year":"1996","unstructured":"Stadler, P.F.: Landscapes and their correlation functions. J. Math. Chem. 20, 1\u201345 (1996)","journal-title":"J. Math. Chem."},{"key":"9170_CR29","volume-title":"Biological Evolution and Statistical Physics","author":"P.F. Stadler","year":"2002","unstructured":"Stadler, P.F.: Biological Evolution and Statistical Physics. Springer, Berlin (2002). Chap. Fitness Landscapes, pp.\u00a0183\u2013204"},{"key":"9170_CR30","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1145\/1569901.1569952","volume-title":"Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation","author":"A.M. Sutton","year":"2009","unstructured":"Sutton, A.M., Whitley, L.D., Howe, A.E.: A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp.\u00a0365\u2013372. ACM, New York (2009)"},{"key":"9170_CR31","volume-title":"Proceedings of Symposium on Combinatorial Search","author":"A.M. Sutton","year":"2010","unstructured":"Sutton, A.M., Howe, A.E., Whitley, L.D.: Directed plateau search for MAX-k-SAT. In: Proceedings of Symposium on Combinatorial Search, Atlanta, GA, USA (2010)"},{"key":"9170_CR32","author":"A.M. Sutton","year":"2011","unstructured":"Sutton, A.M., Whitley, L.D., Howe, A.E.: Computing the moments of k-bounded pseudo-boolean functions over hamming spheres of arbitrary radius in polynomial time. Theor. Comput. Sci.. doi: 10.1016\/j.tcs.2011.02.006 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9170_CR33","doi-asserted-by":"crossref","first-page":"5","DOI":"10.2307\/2387224","volume":"45","author":"J.L. Walsh","year":"1923","unstructured":"Walsh, J.L.: A closed set of normal orthogonal functions. Am. J. Math. 45(1), 5\u201324 (1923)","journal-title":"Am. J. Math."},{"issue":"5","key":"9170_CR34","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00202749","volume":"63","author":"E. Weinberger","year":"1990","unstructured":"Weinberger, E.: Correlated and uncorrelated fitness landscapes and how to tell the difference. Biol. Cybern. 63(5), 325\u2013336 (1990)","journal-title":"Biol. Cybern."},{"key":"9170_CR35","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1145\/1389095.1389208","volume-title":"Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation","author":"D. Whitley","year":"2008","unstructured":"Whitley, D., Sutton, A.M., Howe, A.E.: Understanding elementary landscapes. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, pp. 585\u2013592. ACM, New York (2008)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9170-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9170-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9170-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T11:40:47Z","timestamp":1637754047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9170-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,1]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9170"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9170-6","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2011,6,1]]}}}