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

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

£135.00
Hardback Published: 01/08/2002
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket

Check Marketplace availability

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.

Publisher: Kluwer Academic Publishers
ISBN: 9781402071737

You may also be interested in...

Your review has been submitted successfully.

We would love to hear what you think of Waterstones. Why not review Waterstones on Trustpilot?


Review us on Trustpilot