Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 155,55
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 159,45
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Idioma: Inglés
Publicado por Kluwer Academic Publishers, 2002
ISBN 10: 1402005474 ISBN 13: 9781402005473
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 202,49
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. Semidefinite programming has been described as linear programming for the year 2000. This monograph explains the basic theory of interior point algorithms. It includes the results on the properties of the central path as well as the analysis of the most important classes of algorithms. Series: Applied Optimization. Num Pages: 304 pages, biography. BIC Classification: PBU; PBW; UMG. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 235 x 155 x 19. Weight in Grams: 609. . 2002. Hardback. . . . .
Idioma: Inglés
Publicado por Springer US, Springer New York, 2002
ISBN 10: 1402005474 ISBN 13: 9781402005473
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 168,73
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Semidefinite programming has been described as linear programming for the year 2000. It is an exciting new branch of mathematical programming, due to important applications in control theory, combinatorial optimization and other fields. Moreover, the successful interior point algorithms for linear programming can be extended to semidefinite programming.In this monograph the basic theory of interior point algorithms is explained. This includes the latest results on the properties of the central path as well as the analysis of the most important classes of algorithms. Several 'classic' applications of semidefinite programming are also described in detail. These include the Lovász theta function and the MAX-CUT approximation algorithm by Goemans and Williamson. Audience: Researchers or graduate students in optimization or related fields, who wish to learn more about the theory and applications of semidefinite programming.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 230,56
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 300 pages. 9.25x6.25x0.75 inches. In Stock.
Idioma: Inglés
Publicado por Kluwer Academic Publishers, 2002
ISBN 10: 1402005474 ISBN 13: 9781402005473
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 247,77
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. Semidefinite programming has been described as linear programming for the year 2000. This monograph explains the basic theory of interior point algorithms. It includes the results on the properties of the central path as well as the analysis of the most important classes of algorithms. Series: Applied Optimization. Num Pages: 304 pages, biography. BIC Classification: PBU; PBW; UMG. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 235 x 155 x 19. Weight in Grams: 609. . 2002. Hardback. . . . . Books ship from the US and Ireland.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 272,42
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. Like New. book.
Librería: moluna, Greven, Alemania
EUR 136,16
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Semidefinite programming has been described as linear programming for the year 2000. It is an exciting new branch of mathematical programming, due to important applications in control theory, combinatorial optimization and other fields. Moreover, the succes.
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 181,85
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Semidefinite programming has been described as linear programming for the year 2000. It is an exciting new branch of mathematical programming, due to important applications in control theory, combinatorial optimization and other fields. Moreover, the successful interior point algorithms for linear programming can be extended to semidefinite programming.In this monograph the basic theory of interior point algorithms is explained. This includes the latest results on the properties of the central path as well as the analysis of the most important classes of algorithms. Several 'classic' applications of semidefinite programming are also described in detail. These include the Lovász theta function and the MAX-CUT approximation algorithm by Goemans and Williamson. Audience: Researchers or graduate students in optimization or related fields, who wish to learn more about the theory and applications of semidefinite programming. 308 pp. Englisch.
Librería: preigu, Osnabrück, Alemania
EUR 141,20
Cantidad disponible: 5 disponibles
Añadir al carritoBuch. Condición: Neu. Aspects of Semidefinite Programming | Interior Point Algorithms and Selected Applications | E. de Klerk | Buch | xvi | Englisch | 2002 | Springer US | EAN 9781402005473 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.
Idioma: Inglés
Publicado por Springer US, Springer New York Mär 2002, 2002
ISBN 10: 1402005474 ISBN 13: 9781402005473
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 160,49
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Semidefinite programming has been described as linear programming for the year 2000. It is an exciting new branch of mathematical programming, due to important applications in control theory, combinatorial optimization and other fields. Moreover, the successful interior point algorithms for linear programming can be extended to semidefinite programming.In this monograph the basic theory of interior point algorithms is explained. This includes the latest results on the properties of the central path as well as the analysis of the most important classes of algorithms. Several 'classic' applications of semidefinite programming are also described in detail. These include the Lovász theta function and the MAX-CUT approximation algorithm by Goemans and Williamson.Audience: Researchers or graduate students in optimization or related fields, who wish to learn more about the theory and applications of semidefinite programming.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 308 pp. Englisch.