Fast Delivery
Multiple courier options
Rs.2,254
Rs. 2,652
15% OFF
Inclusive all taxes
This Product is out of stock
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. Reprint of the Prentice-Hall, Englewood Cliffs, New Jersey, 1982 edition.
| Author | Christos H. Papadimitriou, Kenneth Steiglitz |
| Publisher | Dover Publications Inc |
| Language | English |
| Binding Type | Paper Back |
| Main Category | Science & Mathematics |
| Sub Category | Mathematics |
| ISBN13 | 9780486402581 |
| SKU | BK 0152134 |
Rs. 399
Rs. 339
15% OFF
Rs. 699
Rs. 559
20% OFF
Multiple courier options
Within 15 Days
100% Secure Payment
Within 1 Business Day