On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex

• Published in: Informatica (Vilnius, Lithuania) Vol. 26; no. 1; pp. 17 - 32
• Main Authors: Aparicio, Guillermo, Casado, Leocadio G., Hendrix, Eligius M.T., G.-Tóth, Boglárka, Garcia, Inmaculada
• Format: Journal Article
• Language: English
• Published: 01.01.2015
• Subjects: Algorithms; Combinatorial analysis; Computational efficiency; Computing costs; Leerstoelgroep Operationele research en logistiek; Operationele Research en Logistiek; Operations Research and Logistics; Optimization; Searching; Trees; WASS; Workload
• ISSN: 0868-4952; 1822-8844
• DOI: 10.15388/Informatica.2015.36

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. This process generates simplices belonging to different shape classes. Having less simplex shapes facilitates the prediction of the further workload from a node in the binary tree, because the same shape leads to the same sub-tree. Irregular sub-simplices generated in the refinement process may have more than one longest edge when n> or =3. The question is how to choose the longest edge to be bisected such that the number of shape classes is as small as possible. We develop a Branch-and-Bound (B&B) algorithm to find the minimum number of classes in the refinement process. The developed B&B algorithm provides a minimum number of eight classes for a regular 3-simplex. Due to the high computational cost of solving this combinatorial problem, future research focuses on using high performance computing to derive the minimum number of shapes in higher dimensions.