|
|
|
Combinatorial Optimization: Algorithms and Complexity
|
(Buch) |
Dieser Artikel gilt, aufgrund seiner Grösse, beim Versand als 3 Artikel!
| Inhalt: |
| 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. |
|
i.d.R. innert 7-14 Tagen versandfertig
Newsfeed | 
Facebook | 
Twitter
