Montant total (1 article articles) :
Destination de la commande :
complexity numerical optimization (34 résultats)
Passer aux résultats principaux de la recherche
Filtres de recherche
Type d'article
- Tous les types de produits
- Livres (34)
- Magazines & Périodiques (Aucun autre résultat ne correspond à ces critères)
- Bandes dessinées (Aucun autre résultat ne correspond à ces critères)
- Partitions de musique (Aucun autre résultat ne correspond à ces critères)
- Art, Affiches et Gravures (Aucun autre résultat ne correspond à ces critères)
- Photographies (Aucun autre résultat ne correspond à ces critères)
- Cartes (Aucun autre résultat ne correspond à ces critères)
- Manuscrits & Papiers anciens (Aucun autre résultat ne correspond à ces critères)
Etat En savoir plus
- Neuf (28)
- Comme neuf, Très bon ou Bon (6)
- Assez bon ou satisfaisant (Aucun autre résultat ne correspond à ces critères)
- Moyen ou mauvais (Aucun autre résultat ne correspond à ces critères)
- Conformément à la description (Aucun autre résultat ne correspond à ces critères)
Particularités
- Ed. originale (Aucun autre résultat ne correspond à ces critères)
- Signé (Aucun autre résultat ne correspond à ces critères)
- Jaquette (2)
- Avec images (11)
- Sans impressions à la demande (22)
Langue (1)
Livraison gratuite
- Livraison gratuite à destination de Etats-Unis (Aucun autre résultat ne correspond à ces critères)
Pays
Evaluation du vendeur
-
Complexity in Numerical Optimization
Vendeur : Recycle Bookstore, San Jose, CA, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
EUR 25,06
Expédition à EUR 4,91
Expédition nationale : Etats-UnisQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Near Fine. Etat de la jaquette : Near Fine. The book has mild rubbing to both covers, a paper sticker fixed to the front endpage, and a black ink stamp on the half-title page, otherwise the book is in excellent condition with crisp, unmarked pages, a tight binding, and a strong, clean cover. The dustjacket has rubbing and surface scratching to both covers and a paper sticker on the back cover, otherwise the dustjacket is in similarly excellent condition, intact and attractive.
-
Complexity in Numerical Optimization
Langue: anglais
Edité par World Scientific Pub Co Inc, 1993
ISBN 10 : 9810214154 ISBN 13 : 9789810214159
Vendeur : Orca Knowledge Systems, Inc., Novato, CA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
EUR 36,01
Expédition à EUR 5,08
Expédition nationale : Etats-UnisQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Fine. Etat de la jaquette : Very Good. Signed. Signed and inscribed by the editor on the half title page. Inscribed to Professor S. Smale, Math Dept. City University of Hong Kong. No other markings in book. DJ with shelf wear to edges. Binding is tight. Very lightly read. Computational complexity, originated 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 volume is a collection of articles on recent complexity developments in numerical optimization. The topics covered include complexity of approximation algorithms, new polynomial time algorithms for convex quadratic minimization, interior point algorithms, complexity issues regarding test generation of NP-hard problems, complexity of scheduling problems, min-max, fractional combinatorial.
-
Numerical Infinities and Infinitesimals in Optimization (Emergence, Complexity and Computation)
Livre 43 sur 47 : Emergence, Complexity and ComputationVendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 186,83
Expédition à EUR 13,83
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
-
Numerical Infinities and Infinitesimals in Optimization (Emergence, Complexity and Computation, 43)
Livre 43 sur 47 : Emergence, Complexity and ComputationVendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 186,83
Expédition à EUR 13,83
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
-
Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
EUR 204,45
Expédition à EUR 2,25
Expédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
-
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications, 42)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
EUR 203,27
Expédition à EUR 3,41
Expédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
-
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 223,08
Expédition à EUR 13,83
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
-
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications, 42)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 223,08
Expédition à EUR 13,83
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
-
Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 223,07
Expédition à EUR 17,32
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
-
Numerical Infinities and Infinitesimals in Optimization (Emergence, Complexity and Computation)
Livre 43 sur 47 : Emergence, Complexity and ComputationVendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
EUR 251,22
Expédition à EUR 3,41
Expédition nationale : Etats-UnisQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New.
-
Numerical Infinities and Infinitesimals in Optimization: 43 (Emergence, Complexity and Computation, 43)
Livre 43 sur 47 : Emergence, Complexity and ComputationVendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
EUR 252,70
Expédition à EUR 3,41
Expédition nationale : Etats-UnisQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New.
-
EUR 184,85
Expédition à EUR 70
Expédition depuis Allemagne vers Etats-UnisQuantité disponible : 5 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Approximation and Complexity in Numerical Optimization | Continuous and Discrete Problems | Panos M. Pardalos | Taschenbuch | Nonconvex Optimization and Its Applications | xiv | Englisch | 2010 | Springer | EAN 9781441948298 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Approximation and Complexity in Numerical Optimization
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
EUR 279,79
Expédition à EUR 3,41
Expédition nationale : Etats-UnisQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 604.
-
Approximation and Complexity in Numerical Optimization
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
EUR 281,92
Expédition à EUR 3,41
Expédition nationale : Etats-UnisQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 602.
-
EUR 238,59
Expédition à EUR 48,99
Expédition depuis Allemagne vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierGebunden. Etat : 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.
-
Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
EUR 223,11
Expédition à EUR 64,48
Expédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
EUR 306,82
Expédition à EUR 2,25
Expédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
-
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 302,29
Expédition à EUR 17,32
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 2 disponible(s)
Ajouter au panierPaperback. Etat : Brand New. 594 pages. 9.00x6.50x1.36 inches. In Stock.
-
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications, 42)
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
EUR 293,73
Expédition à EUR 28,86
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
EUR 296,19
Expédition à EUR 65,31
Expédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Ajouter au panierBuch. Etat : 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.
-
Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
EUR 438,79
Expédition à EUR 17,32
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
-
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications (closed))
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
EUR 429,29
Expédition à EUR 28,86
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Like New. Like New. book.
-
Approximation and Complexity in Numerical Optimization (eng)
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Évaluation du vendeur 4 sur 5 étoiles
EUR 166,29
Expédition à EUR 8
Expédition depuis Italie vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : new. Questo è un articolo print on demand.
-
EUR 180,07
Expédition à EUR 48,99
Expédition depuis Allemagne vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.
-
Approximation and Complexity in Numerical Optimization
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
EUR 213,99
Expédition à EUR 23
Expédition depuis Allemagne vers Etats-UnisQuantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - 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. 600 pp. Englisch.
-
Numerical Infinities and Infinitesimals in Optimization (Emergence, Complexity and Computation)
Livre 43 sur 47 : Emergence, Complexity and ComputationVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
EUR 261,28
Expédition à EUR 7,50
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. Print on Demand.
-
Numerical Infinities and Infinitesimals in Optimization: 43 (Emergence, Complexity and Computation, 43)
Livre 43 sur 47 : Emergence, Complexity and ComputationVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
EUR 262,83
Expédition à EUR 7,50
Expédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. Print on Demand.
-
Approximation and Complexity in Numerical Optimization
Langue: anglais
Edité par Springer, Springer Dez 2010, 2010
ISBN 10 : 1441948295 ISBN 13 : 9781441948298
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
EUR 213,99
Expédition à EUR 60
Expédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 600 pp. Englisch.
-
Numerical Infinities and Infinitesimals in Optimization (Emergence, Complexity and Computation)
Livre 43 sur 47 : Emergence, Complexity and ComputationVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
EUR 266,82
Expédition à EUR 9,95
Expédition depuis Allemagne vers Etats-UnisQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. PRINT ON DEMAND.
-
Numerical Infinities and Infinitesimals in Optimization: 43 (Emergence, Complexity and Computation, 43)
Livre 43 sur 47 : Emergence, Complexity and ComputationVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
EUR 267,15
Expédition à EUR 9,95
Expédition depuis Allemagne vers Etats-UnisQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. PRINT ON DEMAND.
