|
|
||
![]() |
||
| HELP | ||
|
$12.95 List price:
TRADE PAPER, USED
Ships in 1 to 3 days
More copies of this ISBN:Combinatorial Optimization: Algorithms and Complexityby Chris Papadimitriou
Synopses & ReviewsPublisher Comments:This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses 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. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further."—American Mathematical Monthly. 1982 edition. Book News Annotation:A text for a range of graduate courses, with some of the material
suitable for students of computer science with a background in the
theory of algorithms and some suitable for those with a background in
operations research. Corrected and unabridged from the 1982
publication by Prentice-Hall, with a new preface.
Annotation c. Book News, Inc., Portland, OR (booknews.com) Synopsis:This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problem Synopsis: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. .Synopsis:This 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; local search heuristics for NP-complete problems, more. 1982 edition. What Our Readers Are SayingBe the first to add a comment for a chance to win!Product Details
Other books you might like
Related Aisles | ||||||||||||
|
| |||||||||||||
|
|
|||||||||||||