@article{jco-salm15,
author = {J.M.G. Salmerón, G. Aparicio, L.G. Casado, I. García, E.M.T. Hendrix and B.G. Tóth},
title = {Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement},
journal = {Journal of Combinatorial Optimization},
year = {2017},
pages = {1--14},
abstract = {In several areas like global optimization using branch-and-bound methods for mixture design, the unit n-simplex is refined by longest edge bisection (LEB). This process provides a binary search tree. For \$\$n>2\$\$ n > 2 , simplices appearing during the refinement process can have more than one longest edge (LE). The size of the resulting binary tree depends on the specific sequence of bisected longest edges. The questions are how to calculate the size of one of the smallest binary trees generated by LEB and how to find the corresponding sequence of LEs to bisect, which can be represented by a set of LE indices. Algorithms answering these questions are presented here. We focus on sets of LE indices that are repeated at a level of the binary tree. A set of LEs was presented in Aparicio et al. (Informatica 26(1):17--32, 2015), for \$\$n=3\$\$ n = 3 . An additional question is whether this set is the best one under the so-called \$\$m\_k\$\$ m k -valid condition.},
issn = {1573-2886},
doi = {10.1007/s10878-015-9970-y},
url = {http://dx.doi.org/10.1007/s10878-015-9970-y},
}