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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Bestandsnummer des Verkäufers ria9780792362753_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: 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. . . . . Bestandsnummer des Verkäufers V9780792362753
Anzahl: 15 verfügbar
Anbieter: moluna, Greven, Deutschland
Gebunden. Zustand: 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. Bestandsnummer des Verkäufers 5969296
Anzahl: Mehr als 20 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: 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. Bestandsnummer des Verkäufers V9780792362753
Anzahl: 15 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: 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. Bestandsnummer des Verkäufers 9780792362753
Anzahl: 1 verfügbar
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
Hardcover. Zustand: Like New. Like New. book. Bestandsnummer des Verkäufers ERICA75807923627565
Anzahl: 1 verfügbar