Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 63,17
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 140.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 61,01
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 140 Illus.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 62,28
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 140.
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
EUR 76,77
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 112,71
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 114,44
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 112,40
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 130,15
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 114,42
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Kluwer Academic Publishers, 2002
ISBN 10: 1402071736 ISBN 13: 9781402071737
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 129,83
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. Focusing on linear programming theory, this book draws on the research developments in three areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. Series: International Series in Operations Research & Management Science. Num Pages: 130 pages, biography. BIC Classification: PBUH; TGP. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 9. Weight in Grams: 830. . 2002. Hardback. . . . .
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 142,15
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 136.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 147,53
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 130 pages. 9.25x6.10x0.31 inches. In Stock.
Librería: preigu, Osnabrück, Alemania
EUR 95,15
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice | Daniel Bienstock | Taschenbuch | xix | Englisch | 2013 | Springer | EAN 9781475776720 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Idioma: Inglés
Publicado por Kluwer Academic Publishers, 2002
ISBN 10: 1402071736 ISBN 13: 9781402071737
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 162,07
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. Focusing on linear programming theory, this book draws on the research developments in three areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. Series: International Series in Operations Research & Management Science. Num Pages: 130 pages, biography. BIC Classification: PBUH; TGP. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 9. Weight in Grams: 830. . 2002. Hardback. . . . . Books ship from the US and Ireland.
Librería: moluna, Greven, Alemania
EUR 118,64
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical ana.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 112,77
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 211,85
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 202,34
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. Like New. book.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 162,93
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware - Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 236,47
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 86,24
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 106,99
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments. 136 pp. Englisch.
Librería: moluna, Greven, Alemania
EUR 92,27
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical ana.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 148,73
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 136 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 149,49
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 136.
Idioma: Inglés
Publicado por Springer, Springer Mär 2013, 2013
ISBN 10: 1475776721 ISBN 13: 9781475776720
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 106,99
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 136 pp. Englisch.