Overview
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.
While major retailers like Amazon may carry Combinatorial Optimization (Algorithms and Complexity), we specialize in bulk book sales and offer personalized service from our friendly, book-smart team based in Portland, Oregon. We’re proud to offer a Price Match Guarantee and a streamlined ordering experience from people who truly care.
We’re trusted by over 75,000 customers, many of whom return time and again. Want proof? Just check out our 25,000+ customer reviews—real feedback from people who love how we do business.
Prefer to talk to a real person? Our Book Specialists are here Monday–Friday, 8 a.m. to 5 p.m. PST and ready to help with your bulk order of Combinatorial Optimization (Algorithms and Complexity).