369:-
Tillfälligt slut online – klicka på "Bevaka" för att få ett mejl så fort varan går att köpa igen.
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.
- Format: Pocket/Paperback
- ISBN: 9780486402581
- Språk: Engelska
- Antal sidor: 528
- Utgivningsdatum: 2000-02-01
- Förlag: Dover Publications Inc.