Combinatorial Optimization: Algorithms and Complexity - Kenneth Steiglitz,Christos H. Papadimitriou
-25% su kodu BOOKS
Pristatymas per 31-37 d.d.
30 dienų grąžinimo politika
Clearly written graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. "Mathematicians wishing a self-contained introduction need look no further." - American Mathematical Monthly. 19 ... Visas aprašymas
Aprašymas
Clearly written graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. "Mathematicians wishing a self-contained introduction need look no further." - American Mathematical Monthly. 1982 edition.
Daugiau informacijos
| Autorius | Kenneth Steiglitz, Christos H. Papadimitriou |
|---|---|
| Leidėjas | Dover Publications Inc. |
| Išleidimo metai | 2000 |
| Viršelio tipas | Minkšti viršeliai |
| EAN | 9780486402581 |