Mostrar el registro sencillo del ítem
Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem
dc.contributor.author | Whitley, L. Darrell | |
dc.contributor.author | Chicano-García, José-Francisco | |
dc.date.accessioned | 2014-04-04T07:12:29Z | |
dc.date.available | 2014-04-04T07:12:29Z | |
dc.date.issued | 2014-04-04 | |
dc.identifier.uri | http://hdl.handle.net/10630/7381 | |
dc.description.abstract | 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. | es_ES |
dc.description.sponsorship | Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. | es_ES |
dc.language.iso | spa | es_ES |
dc.rights | info:eu-repo/semantics/openAccess | |
dc.subject | Hamilton, Sistemas de | es_ES |
dc.subject.other | Landscape theory | es_ES |
dc.subject.other | Elementary landscapes | es_ES |
dc.subject.other | Hamiltonian path optimization | es_ES |
dc.subject.other | Quadratic assignment problem | es_ES |
dc.title | Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.centro | E.T.S.I. Informática | es_ES |
dc.relation.eventtitle | The 14th European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP 2014) | es_ES |
dc.relation.eventplace | Granada, España | es_ES |
dc.relation.eventdate | abril de 2014 | es_ES |
dc.type.hasVersion | info:eu-repo/semantics/submittedVersion | es_ES |