ISBN is

978-0-13-152462-0 / 0131524623

Combinatorial Optimization: Algorithms and Complexity

by Papadimitriou, Christos H.

Publisher:Prentice Hall

Edition:Hardcover

Language:English

Prices INCLUDE standard shipping to United States
Show prices without shipping
Change shipping destination
Shipping prices may be approximate. Please verify cost before checkout.

About the book:

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.

Search under way...

Search complete.

Click on the price to find out more about a book.

New books: 1 - 25 of 26

   

Used books: 1 - 25 of 103