Deterministic Global Optimization: Geometric Branch-and-bound Methods and their Applications
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.
What people are saying - Write a review
Chapter 1 Principles and basic concepts
Chapter 2 The geometric branchandbound algorithm
Chapter 3 Bounding operations
Chapter 4 Extension for multicriteria problems
Chapter 5 Multicriteria discarding tests
Chapter 6 Extension for mixed combinatorial problems
Chapter 7 The circle detection problem