2026-06-01T18:38:23Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/100332026-02-03T12:33:42Zcom_10630_2254col_10630_37959

Heuristics for Longest Edge Selection in Simplicial Branch and Bound Herrera, Juan F.R. Casado, Leocadio G. Hendrix, Eligius María Theodorus García-Fernández, Inmaculada Arquitectura de ordenadores 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. 2015-07-06T10:37:21Z 2015-07-06T10:37:21Z 2015-07-06T10:37:21Z 2015-07-06 conference output http://hdl.handle.net/10630/10033 eng ICCSA 2015 Banff, Canada 22 Junio 2015 open access by-nc-nd