Combinatorial Optimization by Christos H. Papadimitriou, Paperback, 9780486402581 | Buy online at The Nile
Departments
 Free Returns*

Combinatorial Optimization

Algorithms and Complexity

Author: Christos H. Papadimitriou   Series: Dover Books on Computer Science

Paperback

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.

Read more
New
$84.64
Or pay later with
Check delivery options
Paperback

PRODUCT INFORMATION

Summary

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.

Read more

Description

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.

Read more

About the Author

Christos H. Papadimitriou is C. Lester Hogan Professor of Electrical Engineering and Computer Sciences at the University of California, Berkeley, where he has taught since 1996 and where he is a former Miller Fellow.

Read more

More on this Book

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.

Read more

Product Details

Publisher
Dover Publications Inc.
Published
1st February 2000
Edition
New edition
Pages
528
ISBN
9780486402581

Returns

This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.

New
$84.64
Or pay later with
Check delivery options