Global Optimization Simplex Bisection Revisited Based on Considerations by Reiner Horst

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

5 Citations (Scopus)

Abstract

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.
Original languageUnknown
Title of host publicationLecture Notes in Computer Science
Pages159-173
Volume7335
DOIs
Publication statusPublished - 1 Jan 2012
Event12th International Conference on Computational Science and Its Applications (ICCSA) -
Duration: 1 Jan 2012 → …

Conference

Conference12th International Conference on Computational Science and Its Applications (ICCSA)
Period1/01/12 → …

Cite this