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.

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Seller's business information

London Bridge Books LTD
305 Regents Park Road, Finchley, London, N3 1DP, United Kingdom

Sale & Shipping Terms

Terms of Sale

Shipping Terms

Shipping rates from United Kingdom to U.S.A.

Shipping rates from United Kingdom to U.S.A.
Order quantity	14 to 45 business days	5 to 10 business days
First item	US$ 60.25	US$ 100.41

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.