Combinatorial Optimization: Algorithms and Complexity
0131524623
9780131524620
Description:
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.
Best prices to buy, sell, or rent ISBN 9780131524620
Frequently Asked Questions about Combinatorial Optimization: Algorithms and Complexity
The price for the book starts from $18.94 on Amazon and is available from 13 sellers at the moment.
If you’re interested in selling back the Combinatorial Optimization: Algorithms and Complexity book, you can always look up BookScouter for the best deal. BookScouter checks 30+ buyback vendors with a single search and gives you actual information on buyback pricing instantly.
As for the Combinatorial Optimization: Algorithms and Complexity book, the best buyback offer comes from and is $ for the book in good condition.
The Combinatorial Optimization: Algorithms and Complexity book is in very low demand now as the rank for the book is 2,011,042 at the moment. A rank of 1,000,000 means the last copy sold approximately a month ago.
Not enough insights yet.