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. 1982 ed.

Author: Papadimitriou

VAT: No

Minimum Order Quantity: 0

Delivery:  Usually ships in 28 days. Import title.    

All UK orders are POST FREE!

All prices shown include applicable taxes.