@inbook{dde8a1209b4d4ed5a045878a7ae9eba8,
title = "On grid aware refinement of the unit hypercube and simplex: Focus on the complete tree size",
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.",
author = "L.G. Casado and E.M.T. Hendrix and J.M.G. Salmer{\'o}n and B.G. T{\'o}th and I. Garc{\'i}a",
year = "2017",
doi = "10.1007/978-3-319-62398-6_12",
language = "English",
isbn = "9783319623979",
series = "Lecture Notes in Computer Science (LNCS)",
publisher = "Springer",
pages = "165--180",
editor = "O. Gervasi and B. Murgante and S. Misra and G. Borruso and C.M. Torre and A.M.A.C. Rocha and D. Taniar and B.O. Apduhan and E. Stankova and A. Cuzzocrea",
booktitle = "Computational Science and Its Applications - ICCSA 2017",
note = "The 17th International Conference on Computational Science and Its Applications (ICCSA 2017) ; Conference date: 03-07-2017 Through 06-07-2017",
}