Abstract
Simplicial partitions are suitable to divide a bounded area in branch and bound. In the iterative
refinement process, a popular strategy is to divide simplices by their longest edge, thus avoiding
needle-shaped simplices. A range of possibilities arises when the number of longest edges in a
simplex is greater than one. The behaviour of the search is different depending on the selected
longest edge. In this work, we investigate the importance of the rule to select an edge.
Original language | English |
---|---|
Title of host publication | Proceedings of the XII Global Optimization Workshop MAGO 2014 |
Editors | L.G. Casado, I. García, E.M.T. Hendrix |
Publisher | Universidad de Almería |
Pages | 85-88 |
Publication status | Published - 2014 |
Event | MAGO'14 on Mathematiacal and applied Global Optimization, Málaga, Spain - Duration: 1 Sept 2014 → 4 Sept 2014 |
Conference/symposium
Conference/symposium | MAGO'14 on Mathematiacal and applied Global Optimization, Málaga, Spain |
---|---|
Period | 1/09/14 → 4/09/14 |