7 research outputs found

    Global Optimization Simplex Bisection Revisited Based on Considerations by Reiner Horst

    No full text
    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
    corecore