RT Journal Article
T1 Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem
A1 Whitley, L. Darrell
A1 Chicano-García, José-Francisco
K1 Hamilton, Sistemas de
AB 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 dis- play this structure are called “Elementary Landscapes” and they have a number of special mathematical properties. The problems that are not elementary landscapes can be decomposed in a sum of elementary ones. This sum is called the elementary landscape decomposition of the problem. In this paper, we provide the elementary landscape decomposi- tion for the Hamiltonian Path Optimization Problem under two different neighborhoods.
YR 2014
FD 2014-04-04
LK http://hdl.handle.net/10630/7381
UL http://hdl.handle.net/10630/7381
LA spa
NO Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech.
DS RIUMA. Repositorio Institucional de la Universidad de Málaga
RD 20 ene 2026