Skip to main content
Conference Proceedings

Global optimization simplex bisection revisited based on considerations by Reiner Horst

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7335 LNCS(PART 3) 159-173
DOI: 10.1007/978-3-642-31137-6_12
6Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Hendrix, E. M. T., Casado, L. G., & Amaral, P. (2012). Global optimization simplex bisection revisited based on considerations by Reiner Horst. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7335 LNCS, pp. 159–173). https://doi.org/10.1007/978-3-642-31137-6_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free