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 contributionAcademicpeer-review

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.
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

Cite this

Herrera, J. F. R., Casado, L. G., & Hendrix, E. M. T. (2014). On longest edge division in simplicial branch and bound. In L. G. Casado, I. García, & E. M. T. Hendrix (Eds.), Proceedings of the XII Global Optimization Workshop MAGO 2014 (pp. 85-88). Universidad de Almería.
Herrera, J.F.R. ; Casado, L.G. ; Hendrix, E.M.T. / On longest edge division in simplicial branch and bound. Proceedings of the XII Global Optimization Workshop MAGO 2014. editor / L.G. Casado ; I. García ; E.M.T. Hendrix. Universidad de Almería, 2014. pp. 85-88
@inproceedings{4e77ea33133d4a23b7b278b0d3a2529d,
title = "On longest edge division in simplicial branch and bound",
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.",
author = "J.F.R. Herrera and L.G. Casado and E.M.T. Hendrix",
year = "2014",
language = "English",
pages = "85--88",
editor = "L.G. Casado and I. Garc{\'i}a and E.M.T. Hendrix",
booktitle = "Proceedings of the XII Global Optimization Workshop MAGO 2014",
publisher = "Universidad de Almer{\'i}a",

}

Herrera, JFR, Casado, LG & Hendrix, EMT 2014, On longest edge division in simplicial branch and bound. in LG Casado, I García & EMT Hendrix (eds), Proceedings of the XII Global Optimization Workshop MAGO 2014. Universidad de Almería, pp. 85-88, MAGO'14 on Mathematiacal and applied Global Optimization, Málaga, Spain, 1/09/14.

On longest edge division in simplicial branch and bound. / Herrera, J.F.R.; Casado, L.G.; Hendrix, E.M.T.

Proceedings of the XII Global Optimization Workshop MAGO 2014. ed. / L.G. Casado; I. García; E.M.T. Hendrix. Universidad de Almería, 2014. p. 85-88.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - On longest edge division in simplicial branch and bound

AU - Herrera, J.F.R.

AU - Casado, L.G.

AU - Hendrix, E.M.T.

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

M3 - Conference contribution

SP - 85

EP - 88

BT - Proceedings of the XII Global Optimization Workshop MAGO 2014

A2 - Casado, L.G.

A2 - García, I.

A2 - Hendrix, E.M.T.

PB - Universidad de Almería

ER -

Herrera JFR, Casado LG, Hendrix EMT. On longest edge division in simplicial branch and bound. In Casado LG, García I, Hendrix EMT, editors, Proceedings of the XII Global Optimization Workshop MAGO 2014. Universidad de Almería. 2014. p. 85-88