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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 2,25 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoEUR 3,40 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoLibrería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLIING23Mar2716030035475
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 13977332-n
Cantidad disponible: Más de 20 disponibles
Librería: Grand Eagle Retail, Mason, OH, Estados Unidos de America
Hardcover. Condición: new. Hardcover. 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. This book examines geometric branch-and-bound methods, such as in Lipschitzian optimization, d.c. programming and interval analysis, introduces a new concept for the rate of convergence and also analyzes several bounding operations reported in the literature. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9781461419501
Cantidad disponible: 1 disponibles
Librería: Best Price, Torrance, CA, Estados Unidos de America
Condición: New. SUPER FAST SHIPPING. Nº de ref. del artículo: 9781461419501
Cantidad disponible: 2 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 13977332
Cantidad disponible: Más de 20 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 156 pp. Englisch. Nº de ref. del artículo: 9781461419501
Cantidad disponible: 2 disponibles
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: New. This book examines geometric branch-and-bound methods, such as in Lipschitzian optimization, d.c. programming and interval analysis, introduces a new concept for the rate of convergence and also analyzes several bounding operations reported in the literature. Series: Springer Optimization and Its Applications / Nonconvex Optimization and Its Applications. Num Pages: 142 pages, 19 black & white tables, biography. BIC Classification: KJT; PBKS; PBU. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 11. Weight in Grams: 402. . 2011. Hardback. . . . . Nº de ref. del artículo: V9781461419501
Cantidad disponible: 15 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 13977332
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 13977332-n
Cantidad disponible: Más de 20 disponibles
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
Condición: New. This book examines geometric branch-and-bound methods, such as in Lipschitzian optimization, d.c. programming and interval analysis, introduces a new concept for the rate of convergence and also analyzes several bounding operations reported in the literature. Series: Springer Optimization and Its Applications / Nonconvex Optimization and Its Applications. Num Pages: 142 pages, 19 black & white tables, biography. BIC Classification: KJT; PBKS; PBU. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 11. Weight in Grams: 402. . 2011. Hardback. . . . . Books ship from the US and Ireland. Nº de ref. del artículo: V9781461419501
Cantidad disponible: 15 disponibles