Verwandte Artikel zu Potential Function Methods for Approximately Solving...

Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice: 53 (International Series in Operations Research & Management Science) - Softcover

 
9781475776720: Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice: 53 (International Series in Operations Research & Management Science)

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Gratis für den Versand innerhalb von/der Deutschland

Versandziele, Kosten & Dauer

Weitere beliebte Ausgaben desselben Titels

9781402071737: Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice: 53 (International Series in Operations Research & Management Science)

Vorgestellte Ausgabe

ISBN 10:  1402071736 ISBN 13:  9781402071737
Verlag: Springer, 2002
Hardcover

Suchergebnisse für Potential Function Methods for Approximately Solving...

Foto des Verkäufers

Daniel Bienstock
Verlag: Springer US, Springer US, 2013
ISBN 10: 1475776721 ISBN 13: 9781475776720
Neu Taschenbuch

Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Taschenbuch. Zustand: 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. Artikel-Nr. 9781475776720

Verkäufer kontaktieren

Neu kaufen

EUR 109,94
Währung umrechnen
Versand: Gratis
Innerhalb Deutschlands
Versandziele, Kosten & Dauer

Anzahl: 1 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Bienstock, Daniel
Verlag: Springer, 2013
ISBN 10: 1475776721 ISBN 13: 9781475776720
Neu Softcover

Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. In. Artikel-Nr. ria9781475776720_new

Verkäufer kontaktieren

Neu kaufen

EUR 113,47
Währung umrechnen
Versand: EUR 5,70
Von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Daniel Bienstock
Verlag: Springer, 2013
ISBN 10: 1475776721 ISBN 13: 9781475776720
Neu Paperback

Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Paperback. Zustand: Brand New. 130 pages. 9.25x6.10x0.31 inches. In Stock. Artikel-Nr. x-1475776721

Verkäufer kontaktieren

Neu kaufen

EUR 146,99
Währung umrechnen
Versand: EUR 11,44
Von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: 2 verfügbar

In den Warenkorb