Gesamtpreis (1 Artikel Artikel):
Versandziel:
complexity numerical optimization (34 Ergebnisse)
Direkt zu den wichtigsten Suchergebnissen
Suchfilter
Produktart
- Alle Product Types
- Bücher (34)
- Magazine & Zeitschriften (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Comics (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Noten (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Kunst, Grafik & Poster (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Fotografien (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Karten (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Manuskripte & Papierantiquitäten (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
Zustand Mehr dazu
- Neu (28)
- Wie Neu, Sehr Gut oder Gut Bis Sehr Gut (6)
- Gut oder Befriedigend (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Ausreichend oder Schlecht (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Wie beschrieben (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
Weitere Eigenschaften
- Erstausgabe (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Signiert (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
- Schutzumschlag (2)
- Angebotsfoto (11)
- Keine Print-on-Demand Angebote (22)
Sprache (1)
Gratisversand
- Kostenloser Versand nach USA (Keine weiteren Ergebnisse entsprechen dieser Verfeinerung)
Land des Verkäufers
Verkäuferbewertung
-
Complexity in Numerical Optimization
Anbieter: Recycle Bookstore, San Jose, CA, USA
Verkäuferbewertung 4 von 5 Sternen
Hardcover. Zustand: Near Fine. Zustand des Schutzumschlags: 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
Sprache: Englisch
Verlag: World Scientific Pub Co Inc, 1993
ISBN 10: 9810214154 ISBN 13: 9789810214159
Anbieter: Orca Knowledge Systems, Inc., Novato, CA, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Fine. Zustand des Schutzumschlags: 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)
Buch 43 von 47: Emergence, Complexity and ComputationAnbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
EUR 185,80
EUR 13,76 Versand
Versand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
-
Numerical Infinities and Infinitesimals in Optimization (Emergence, Complexity and Computation, 43)
Buch 43 von 47: Emergence, Complexity and ComputationAnbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
EUR 185,80
EUR 13,76 Versand
Versand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
-
Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
EUR 205,39
EUR 2,26 Versand
Versand innerhalb von USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
-
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications, 42)
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
EUR 204,21
EUR 3,42 Versand
Versand innerhalb von USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
-
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
EUR 221,86
EUR 13,76 Versand
Versand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
-
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications, 42)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
EUR 221,86
EUR 13,76 Versand
Versand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
-
Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
EUR 221,84
EUR 17,22 Versand
Versand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
-
-
-
Taschenbuch. Zustand: 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.
-
Zustand: New. pp. 604.
-
Zustand: New. pp. 602.
-
EUR 238,59
EUR 48,99 Versand
Versand von Deutschland nach USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbGebunden. 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.
-
Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
EUR 308,24
EUR 2,26 Versand
Versand innerhalb von USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
-
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
EUR 300,63
EUR 17,22 Versand
Versand von Vereinigtes Königreich nach USAAnzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: 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)
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
EUR 292,11
EUR 28,71 Versand
Versand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
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.
-
Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
EUR 436,39
EUR 17,22 Versand
Versand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
-
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications (closed))
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
EUR 426,94
EUR 28,71 Versand
Versand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: Like New. Like New. book.
-
Approximation and Complexity in Numerical Optimization (eng)
Anbieter: Brook Bookstore On Demand, Napoli, NA, Italien
Verkäuferbewertung 4 von 5 Sternen
EUR 166,29
EUR 8,00 Versand
Versand von Italien nach USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: new. Questo è un articolo print on demand.
-
EUR 180,07
EUR 48,99 Versand
Versand von Deutschland nach USAAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: 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
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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)
Buch 43 von 47: Emergence, Complexity and ComputationAnbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
EUR 262,49
EUR 7,46 Versand
Versand von Vereinigtes Königreich nach USAAnzahl: 4 verfügbar
In den WarenkorbZustand: New. Print on Demand.
-
Numerical Infinities and Infinitesimals in Optimization: 43 (Emergence, Complexity and Computation, 43)
Buch 43 von 47: Emergence, Complexity and ComputationAnbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
EUR 264,04
EUR 7,46 Versand
Versand von Vereinigtes Königreich nach USAAnzahl: 4 verfügbar
In den WarenkorbZustand: New. Print on Demand.
-
Approximation and Complexity in Numerical Optimization
Sprache: Englisch
Verlag: Springer, Springer Dez 2010, 2010
ISBN 10: 1441948295 ISBN 13: 9781441948298
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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)
Buch 43 von 47: Emergence, Complexity and ComputationAnbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. PRINT ON DEMAND.
-
Numerical Infinities and Infinitesimals in Optimization: 43 (Emergence, Complexity and Computation, 43)
Buch 43 von 47: Emergence, Complexity and ComputationAnbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. PRINT ON DEMAND.
