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...
Main Author: | |
---|---|
Corporate Author: | |
Format: | Electronic eBook |
Language: | English |
Published: |
New York, NY :
Springer New York,
2012.
|
Series: | Springer Optimization and Its Applications,
63 |
Subjects: | |
Online Access: | Full Text via HEAL-Link |
Table of Contents:
- 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.