Mostrar el registro sencillo del ítem

dc.contributor.authorWhitley, Darrell
dc.contributor.authorChicano, Francisco 
dc.date.accessioned2014-04-04T07:12:29Z
dc.date.available2014-04-04T07:12:29Z
dc.date.issued2014-04-04
dc.identifier.urihttp://hdl.handle.net/10630/7381
dc.description.abstractThere 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.sponsorshipUniversidad de Málaga. Campus de Excelencia Internacional Andalucía Tech.es_ES
dc.language.isospaes_ES
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectHamilton, Sistemas dees_ES
dc.subject.otherLandscape theoryes_ES
dc.subject.otherElementary landscapeses_ES
dc.subject.otherHamiltonian path optimizationes_ES
dc.subject.otherQuadratic assignment problemes_ES
dc.titleElementary Landscape Decomposition of the Hamiltonian Path Optimization Problemes_ES
dc.typeinfo:eu-repo/semantics/preprintes_ES
dc.centroE.T.S.I. Informáticaes_ES
dc.relation.eventtitleThe 14th European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP 2014)es_ES
dc.relation.eventplaceGranada, Españaes_ES
dc.relation.eventdateabril de 2014es_ES


Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem