
Tell your friends about this item:
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems - Nonconvex Optimization and Its Applications Softcover reprint of the original 1st ed. 2000 edition
Panos M Pardalos
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems - Nonconvex Optimization and Its Applications Softcover reprint of the original 1st ed. 2000 edition
Panos M Pardalos
On the other hand, computational complexity, originating from the interactions between computer science and numeri cal optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty.
581 pages, biography
Media | Books Paperback Book (Book with soft cover and glued back) |
Released | December 2, 2010 |
ISBN13 | 9781441948298 |
Publishers | Springer-Verlag New York Inc. |
Pages | 581 |
Dimensions | 155 × 235 × 30 mm · 830 g |
Language | English |
Editor | Pardalos, Panos M. |
Show all
More by Panos M Pardalos
See all of Panos M Pardalos ( e.g. Paperback Book and Hardcover Book )