In this paper, the use of non-optimality spheres in a simplicial branch and bound (B&B) algorithm is investigated. In this context, some considerations regarding the use of bisection on the longest edge in relation with ideas of Reiner Horst are reminded. Three arguments highlight the merits of bisection of simplicial subsets in B&B schemes.
|Title of host publication||Lecture Notes in Computer Science|
|Publication status||Published - 1 Jan 2012|
|Event||12th International Conference on Computational Science and Its Applications (ICCSA) - |
Duration: 1 Jan 2012 → …
|Conference||12th International Conference on Computational Science and Its Applications (ICCSA)|
|Period||1/01/12 → …|