Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex

G. Aparicio, L.G. Casado, B.G. Tóth, E.M.T. Hendrix, I. García

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

5 Citations (Scopus)

Abstract

In several areas like Global Optimization using branch-and-bound methods, the unit n-simplex is refined by bisecting the longest edge such that a binary search tree appears. The refinement usually selects the first longest edge and ends when the size of the sub-simplices generated in the refinement is smaller than a given accuracy. Irregular sub-simplices may have more than one longest edge only for n¿=¿3. The question is how to choose the longest edge to be bisected such that the number of sub-simplices in the generated binary tree is minimal. The difficulty of this Combinatorial Optimization problem increases with n. Therefore, heuristics are studied that aim to minimize the number of generated simplices
Original languageEnglish
Title of host publicationProceedings of the Computational Science and its Applications - ICCSA 2014, Part II
Place of PublicationCham
Pages115-125
DOIs
Publication statusPublished - 2014
Event14th ICCSA 2014, Guimarães, Portugal -
Duration: 30 Jun 20143 Jul 2014

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume8580
ISSN (Print)0302-9743

Conference

Conference14th ICCSA 2014, Guimarães, Portugal
Period30/06/143/07/14

Fingerprint Dive into the research topics of 'Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex'. Together they form a unique fingerprint.

  • Cite this

    Aparicio, G., Casado, L. G., Tóth, B. G., Hendrix, E. M. T., & García, I. (2014). Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex. In Proceedings of the Computational Science and its Applications - ICCSA 2014, Part II (pp. 115-125). (Lecture Notes in Computer Science; Vol. 8580).. https://doi.org/10.1007/978-3-319-09129-7_9