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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Scholz, Daniel (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer New York : Imprint: Springer, 2012.
Edición:1st ed. 2012.
Colección:Nonconvex Optimization and Its Applications ; 63
Temas:
Mathematical optimization.
Operations research.
Management science.
Mathematics-Data processing.
Algorithms.
Optimization.
Operations Research, Management Science .
Computational Science and Engineering.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares