Deterministic Global Optimization - Geometric Branch-and-bound Methods and their Applications (Paperback, 2012 ed.)

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.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Nonconvex Optimization and Its Applications, 63
Release date:	2014
First published:	2012
Authors:	Daniel Scholz
Dimensions:	235 x 155 x 9mm (L x W x T)
Format:	Paperback
Pages:	142
Edition:	2012 ed.
ISBN-13:	978-1-4899-9555-1
Categories:	Books > Science & Mathematics > Mathematics > Optimization > General Promotions
LSN:	1-4899-9555-2
Barcode:	9781489995551

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!