Над 4 милиона заглавия на английски и други езици! Открийте новата си история още днес! Безплатна доставка за поръчки над 69.99€

Виж статуса на поръчката

Свържете се с нас

Approximation and Complexity in Numerical Optimization

Name: Approximation and Complexity in Numerical Optimization
Brand: Springer
SKU: 9780792362753
Price: 230.01 EUR
Availability: InStock

Continuous and Discrete Problems

Автор: Panos M. Pardalos

Език:

Корици: С твърди корици

Издател: Springer

Наличност: Външен склад в ограничено количество

Изпращаме след 13-18 дни

230.01 € 449.86 лв

There has been much recent progress in approximation algorithms for nonconvex continuous and discret...

Информация за книгата

Автор

Panos M. Pardalos

Език

Английски език

Корици

Книга - С твърди корици

Издадена

2000

страници

581

EAN

9780792362753

ISBN

0792362756

Enbook ID

01396380

Издател

Springer

Теглоt

2250

Размери

156 x 234 x 37

Пълно описание

There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems, from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geometric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new approximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization problems, new approximate algorithms have been developed based on semidefinite programming and new randomization techniques. On the other hand, computational complexity, originating from the interactions between computer science and numerical optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable. The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions. The two themes of approximation and complexity pervade this book. Audience: Faculty, graduate students, and researchers in mathematical programming, computer sciences and engineering.

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Approximation and Complexity in Numerical Optimization

Continuous and Discrete Problems

Информация за книгата

Пълно описание

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също