2026-06-03T14:37:07Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/82002026-02-03T11:55:13Zcom_10630_2254col_10630_37959

00925njm 22002777a 4500 dc Whitley, L. Darrell author Chicano-García, José-Francisco author 2014-10-07 There exist local search landscapes where the evaluation function is an eigenfunction of the graph Laplacian that corresponds to the neighborhood structure of the search space. Problems that display this structure are called “Elementary Landscapes” and they have a number of special mathematical properties. The term “Quasi-elementary landscapes” is introduced to describe landscapes that are “almost” elementary; in quasi-elementary landscapes there exists some efficiently computed “correction” that captures those parts of the neighborhood structure that deviate from the normal structure found in elementary landscapes. The “shift” operator, as well as the “3-opt” operator for the Traveling Salesman Problem landscapes induce quasi-elementary landscapes. A local search neighborhood for the Maximal Clique problem is also quasi-elementary. Finally, we show that landscapes which are a superposition of elementary landscapes can be quasi-elementary in structure. http://hdl.handle.net/10630/8200 Optimización matemática Quasi-elementary Landscapes and Superpositions of Elementary Landscapes