Global optimization simplex bisection revisited based on considerations by reiner horst

  • Authors:
  • Eligius M. T. Hendrix;Leocadio G. Casado;Paula Amaral

  • Affiliations:
  • Arquitectura de Computadores, Universidad de Málaga, Spain,Logistics and Operations Research, Wageningen University, The Netherlands;Dpt. de Arquitectura de Computadores y Electronica, Universidad de Almería, Spain;Department of Mathematics, Universidade Nova de Lisboa, Portugal,CMA, Universidade Nova de Lisboa, Portugal

  • Venue:
  • ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.