On longest edge division in simplicial branch and bound

J.F.R. Herrera, L.G. Casado, E.M.T. Hendrix

Research output: Chapter in Book/Report/Conference proceedingConference paper

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 languageEnglish
Title of host publicationProceedings of the XII Global Optimization Workshop MAGO 2014
EditorsL.G. Casado, I. García, E.M.T. Hendrix
PublisherUniversidad de Almería
Pages85-88
Publication statusPublished - 2014
EventMAGO'14 on Mathematiacal and applied Global Optimization, Málaga, Spain -
Duration: 1 Sep 20144 Sep 2014

Conference

ConferenceMAGO'14 on Mathematiacal and applied Global Optimization, Málaga, Spain
Period1/09/144/09/14

Fingerprint Dive into the research topics of 'On longest edge division in simplicial branch and bound'. Together they form a unique fingerprint.

Cite this