Staff Publications

Staff Publications

  • external user (warningwarning)
  • Log in as
  • language uk
  • About

    'Staff publications' is the digital repository of Wageningen University & Research

    'Staff publications' contains references to publications authored by Wageningen University staff from 1976 onward.

    Publications authored by the staff of the Research Institutes are available from 1995 onwards.

    Full text documents are added when available. The database is updated daily and currently holds about 240,000 items, of which 72,000 in open access.

    We have a manual that explains all the features 

Record number 532377
Title On grid aware refinement of the unit hypercube and simplex: Focus on the complete tree size
Author(s) Casado, L.G.; Hendrix, E.M.T.; Salmerón, J.M.G.; Tóth, B.G.; García, I.
Source In: Computational Science and Its Applications - ICCSA 2017. - Cham : Springer (Lecture Notes in Computer Science (LNCS) ) - ISBN 9783319623979 - p. 165 - 180.
Event Cham : Springer (Lecture Notes in Computer Science (LNCS) ) - ISBN 9783319623979 The 17th International Conference on Computational Science and Its Applications (ICCSA 2017), Trieste, 2017-07-03/2017-07-06
Department(s) WASS
Operations Research and Logistics
Publication type Peer reviewed book chapter
Publication year 2017
Abstract Branch and bound (BnB) Global Optimization algorithms can be used to find the global optimum (minimum) of a multiextremal function over the unit hypercube and unit simplex with a guaranteed accuracy. Subdivision strategies can take the information of the evaluated points into account leading to irregular shaped subsets. This study focuses on the passive generation of spatial subdivisions aiming at evaluating points on a predefined grid. The efficiency measure is in terms of the complete tree size, or worst case BnB scenario, with a termination criterion on the subset size. Longest edge bisection is used as a benchmark. It is shown that taking the grid for a given termination tolerance into account, other general partitions exist that improve the BnB upper bound on the number of evaluated points and subsets.
There are no comments yet. You can post the first one!
Post a comment
Please log in to use this service. Login as Wageningen University & Research user or guest user in upper right hand corner of this page.