Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 200,54
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 217,77
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 262,89
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 604.
Idioma: Inglés
Publicado por Kluwer Academic Publishers, 2000
ISBN 10: 0792362756 ISBN 13: 9780792362753
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 264,32
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 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. This book deals with the themes of approximation and complexity. Editor(s): Pardalos, Panos M. Series: Nonconvex Optimization and Its Applications. Num Pages: 595 pages, biography. BIC Classification: PBU; TGP. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 33. Weight in Grams: 1017. . 2000. Hardback. . . . .
EUR 227,74
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. 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.
Idioma: Inglés
Publicado por Kluwer Academic Publishers, 2000
ISBN 10: 0792362756 ISBN 13: 9780792362753
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 323,13
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 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. This book deals with the themes of approximation and complexity. Editor(s): Pardalos, Panos M. Series: Nonconvex Optimization and Its Applications. Num Pages: 595 pages, biography. BIC Classification: PBU; TGP. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 33. Weight in Grams: 1017. . 2000. Hardback. . . . . Books ship from the US and Ireland.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 318,78
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware - 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 geomet ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob lems, new approximate algorithms have been developed based on semidefinite pro gramming and new randomization techniques. 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. 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. A conference on Approximation and Complexity in Numerical Optimization: Con tinuous and Discrete Problems was held during February 28 to March 2, 1999 at the Center for Applied Optimization of the University of Florida.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 426,56
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. Like New. book.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 274,06
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 604 Illus.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 281,35
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 604.