Mostrar el registro sencillo del ítem

dc.contributor.authorHerrera, Juan F.R.
dc.contributor.authorCasado, Leocadio G.
dc.contributor.authorHendrix, Eligius Maria Theodorus 
dc.contributor.authorGarcía-Fernández, Inmaculada 
dc.date.accessioned2015-07-06T10:37:21Z
dc.date.available2015-07-06T10:37:21Z
dc.date.created2015
dc.date.issued2015-07-06
dc.identifier.urihttp://hdl.handle.net/10630/10033
dc.descriptionPre-print de la comunicacion presentada al ICCSA2015es_ES
dc.description.abstractSimplicial partitions are suitable to divide a bounded area in branch and bound. In the iterative re nement process, a popular strategy is to divide simplices by their longest edge, thus avoiding needle-shaped simplices. A range of possibilities arises in higher dimensions where the number of longest edges in a simplex is greater than one. The behaviour of the search and the resulting binary search tree depend on the se- lected longest edge. In this work, we investigate different rules to select a longest edge and study the resulting efficiency of the branch and bound algorithm.es_ES
dc.description.sponsorshipUniversidad de Málaga. Campus de Excelencia Internacional Andalucía Tech.es_ES
dc.language.isoenges_ES
dc.rightsinfo:eu-repo/semantics/openAccesses_ES
dc.subjectArquitectura de ordenadoreses_ES
dc.subject.otherBranch & Boundes_ES
dc.titleHeuristics for Longest Edge Selection in Simplicial Branch and Boundes_ES
dc.typeinfo:eu-repo/semantics/preprintes_ES
dc.centroE.T.S.I. Informáticaes_ES
dc.relation.eventtitleICCSA 2015es_ES
dc.relation.eventplaceBanff, Canadaes_ES
dc.relation.eventdate22 Junio 2015es_ES
dc.cclicenseby-nc-ndes_ES


Ficheros en el ítem

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

Mostrar el registro sencillo del ítem