Combinatorial Optimization: Algorithms and Complexity

Front Cover
Courier Corporation, 1982 - Mathematics - 496 pages
4 Reviews
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.

What people are saying - Write a review

We haven't found any reviews in the usual places.

Other editions - View all

References to this book

All Book Search results »

Bibliographic information