RT Conference Proceedings
T1 Heuristics for Longest Edge Selection in Simplicial Branch and Bound
A1 Herrera, Juan F.R.
A1 Casado, Leocadio G.
A1 Hendrix, Eligius María Theodorus
A1 García-Fernández, Inmaculada
K1 Arquitectura de ordenadores
AB Simplicial partitions are suitable to divide a bounded area inbranch and bound. In the iterative re nement process, a popular strategyis to divide simplices by their longest edge, thus avoiding needle-shapedsimplices. A range of possibilities arises in higher dimensions where thenumber of longest edges in a simplex is greater than one. The behaviourof the search and the resulting binary search tree depend on the se-lected longest edge. In this work, we investigate different rules to select alongest edge and study the resulting efficiency of the branch and boundalgorithm.
YR 2015
FD 2015-07-06
LK http://hdl.handle.net/10630/10033
UL http://hdl.handle.net/10630/10033
LA eng
NO Pre-print de la comunicacion presentada al ICCSA2015
NO Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech.
DS RIUMA. Repositorio Institucional de la Universidad de Málaga
RD 19 ene 2026