---

This book examines geometric branch-and-bound methods, such as in Lipschitzian optimization, d.c. programming and interval analysis, introduces a new concept for the rate of convergence and also analyzes several bounding operations reported in the literature.

---

This monograph deals with a general class of solution approaches in deterministic global optimization, namely the geometric branch-and-bound methods which are popular algorithms, for instance, in Lipschitzian optimization, d.c. programming, and interval analysis.It also introduces a new concept for the rate of convergence and analyzes several bounding operations reported in the literature, from the theoretical as well as from the empirical point of view. Furthermore, extensions of the prototype algorithm for multicriteria global optimization problems as well as mixed combinatorial optimization problems are considered. Numerical examples based on facility location problems support the theory. Applications of geometric branch-and-bound methods, namely the circle detection problem in image processing, the integrated scheduling and location makespan problem, and the median line location problem in the three-dimensional space are also presented.
The book is intended for both researchers and students in the areas of mathematics, operations research, engineering, and computer science.

---

Principals and basic concepts.- The geometric branch-and-bound algorithm.-Bounding operations.- Extension for multicriteria problems.- Multicriteria discarding tests.- Extension for mixed combinatorial problems.- The circle detection problem.- Integrated scheduling and location problems.- The median line problem.- Summary and discussion.- References.- Index.

---