Overview
- Numerous examples throughout the text
- Easily accessible format
- In depth exploration of geometric branch-and-bound methods
Part of the book series: Nonconvex Optimization and Its Applications (SOIANOIA, volume 63)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (10 chapters)
-
Front Matter
-
Back Matter
Keywords
About this book
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.
Reviews
From the reviews:
“This little book gives a unified treatment and current state of affairs of geometric branch-and-bound methods for global optimization in low dimensions and their applications. … a valuable tool for anyone interested in the solution of low-dimensional global optimization problems. The whole text is very carefully written with special attention given to the introduction of economical notation and corresponding definitions that considerably shorten the arguments. This is particularly useful for students, but also for the working specialist.” (Frank Plastria, Mathematical Reviews, September, 2013)
“The book presents a collection of papers by Scholz and other authors, supplemented with some auxiliary material and discussion, and includes new details, newly edited text, and revised proofs. … an expert in global optimization and an intended user of global optimization software would benefit from owning this book on geometric B&B methods, which a recognized expert has researched.” (Antanas Zilinskas, Interfaces, Vol. 43 (1), 2013)
Authors and Affiliations
Bibliographic Information
Book Title: Deterministic Global Optimization
Book Subtitle: Geometric Branch-and-bound Methods and their Applications
Authors: Daniel Scholz
Series Title: Nonconvex Optimization and Its Applications
DOI: https://doi.org/10.1007/978-1-4614-1951-8
Publisher: Springer New York, NY
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer Science+Business Media, LLC 2012
Hardcover ISBN: 978-1-4614-1950-1Published: 05 November 2011
Softcover ISBN: 978-1-4899-9555-1Published: 25 January 2014
eBook ISBN: 978-1-4614-1951-8Published: 06 November 2011
Edition Number: 1
Number of Pages: XIV, 142
Topics: Optimization, Operations Research, Management Science, Computational Science and Engineering, Algorithms