Band 53
Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice
-
- Hardcover
- Taschenbuch ausgewählt
-
Sprache:Englisch
Fr. 138.00
inkl. gesetzl. MwSt.,
Beschreibung
Produktdetails
Einband
Taschenbuch
Erscheinungsdatum
17.03.2013
Verlag
Springer UsSeitenzahl
111
Maße (L/B/H)
23.5/15.5/0.8 cm
Gewicht
219 g
Auflage
Softcover reprint of the original 1st ed. 2002
Sprache
Englisch
ISBN
978-1-4757-7672-0
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.
Noch keine Bewertungen vorhanden
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.