Mostrar el registro sencillo del ítem
Heuristics for Longest Edge Selection in Simplicial Branch and Bound
dc.contributor.author | Herrera, Juan F.R. | |
dc.contributor.author | Casado, Leocadio G. | |
dc.contributor.author | Hendrix, Eligius María Theodorus | |
dc.contributor.author | García-Fernández, Inmaculada | |
dc.date.accessioned | 2015-07-06T10:37:21Z | |
dc.date.available | 2015-07-06T10:37:21Z | |
dc.date.created | 2015 | |
dc.date.issued | 2015-07-06 | |
dc.identifier.uri | http://hdl.handle.net/10630/10033 | |
dc.description | Pre-print de la comunicacion presentada al ICCSA2015 | es_ES |
dc.description.abstract | Simplicial 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.sponsorship | Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. | es_ES |
dc.language.iso | eng | es_ES |
dc.rights | info:eu-repo/semantics/openAccess | es_ES |
dc.subject | Arquitectura de ordenadores | es_ES |
dc.subject.other | Branch & Bound | es_ES |
dc.title | Heuristics for Longest Edge Selection in Simplicial Branch and Bound | es_ES |
dc.type | info:eu-repo/semantics/conferenceObject | es_ES |
dc.centro | E.T.S.I. Informática | es_ES |
dc.relation.eventtitle | ICCSA 2015 | es_ES |
dc.relation.eventplace | Banff, Canada | es_ES |
dc.relation.eventdate | 22 Junio 2015 | es_ES |
dc.cclicense | by-nc-nd | es_ES |