Kontakt
Kako nakupovati
Dostava
Svetovalec pri nakupu
Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice
Angleščina
236 b
30 dni za vračilo blaga
Drugi so kupili tudi
/
Mehka
15.47
€
/
Mehka
33.58
€
/
Mehka
50.17
€
/
Mehka
11.83
€
/
Mehka
12.13
€
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.
O knjigi
Angleščina
Podarite to knjigo še danes
To je povsem preprosto
1 Dodajte knjigo v košarico in izberite dostavo kot darilo 2 V zameno vam bomo poslali kupon 3 Knjiga bo dostavljena na naslov obdarovancaMorda bi vas zanimalo tudi
/
Trda
97.42
€
/
Mehka
18.20
€
/
Mehka
5.96
€
/
Mehka
0.00
€
