Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice

Daniel Bienstock

ISBN 10: 1402071736 / ISBN 13: 9781402071737

Edité par Springer US, Springer New York Aug 2002, 2002

A propos de cet article

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 GmbH, Tiergartenstr. 17, 69121 Heidelberg 140 pp. Englisch.

N° de réf. du vendeur 9781402071737

Détails bibliographiques

• Titre: Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice
• Éditeur: Springer US, Springer New York Aug 2002
• Date de parution: 2002
• Langue: anglais
• ISBN à 10 chiffres: 1402071736
• ISBN à 13 chiffres: 9781402071737
• Reliure: Buch
• État de l'article: Neu

A propos de ce titre

Synopsis

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.