num_pages: 528
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.
language: English
title: Combinatorial Optimization: Algorithms and Complexity
titlecomplete: Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)
genres: Computer Science, Mathematics, Programming, Technical, Collections, Reference, Research, Textbooks, Computers, Nonfiction
ratings_count: 130
publisher: Dover Publications