Potential Function Methods for Approximately Solving Linear Programming Problems

de

,

Éditeur :

Kluwer Academic Publishers


Paru le : 2002

eBook Téléchargement DRM Adobe 🛈
132,25

Téléchargement immédiat
Dès validation de votre commande
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

Description

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.
Pages
n.c
Collection
n.c
Parution
2002
Marque
Kluwer Academic Publishers
EAN papier
0306476266
EAN PDF
0306476266

Informations sur l'ebook
Nombre pages copiables
1
Nombre pages imprimables
10
Taille du fichier
1445 Ko
Prix
132,25 €

Suggestions personnalisées