Stock photo: cover may vary
Deterministic Global Optimization: Geometric Branch-and-bound Methods and their Applications (Nonconvex Optimization and Its Applications, 63) Hardback - 2011 - 2012th Edition
by Scholz, Daniel
- Used
- Good
- Hardback
A$125.45
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Standard delivery: 7 to 14 days
Dropship order
Ships from Bonita (California, United States)
Details
- Title Deterministic Global Optimization: Geometric Branch-and-bound Methods and their Applications (Nonconvex Optimization and Its Applications, 63)
- Author Scholz, Daniel
- Binding Hardback
- Edition number 2012th
- Edition 2012
- Condition Used - Good
- Pages 142
- Volumes 1
- Language ENG
- Publisher Springer
- Publication date 2011-11-05
- Features Bibliography, Index, Table of Contents
- Bookseller's Inventory # 1461419506.G
- ISBN 9781461419501 / 1461419506
- Weight 0.88 lbs (0.40 kg)
- Dimensions 9.21 x 6.14 x 0.44 in (23.39 x 15.60 x 1.12 cm)
- Category Mathematics
- Dewey Decimal Code 519.6
- Quantity available 1
About Bonita California, United States
Reader reviews for Deterministic Global Optimization: Geometric Branch-and-bound Methods and their Applications (Nonconvex Optimization and Its Applications, 63)
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the rear cover
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.
