Helpline: 033-41802100
Helpline: 033-41802100
arrow

Menu

arrow
Go Back

Combinatorial Optimization : Algorithms And Complexity

Rs 2,208

Rs 2,598

discount

-15%

Inclusive of all taxes

This item is currently Out of Stock

Out Of Stock

Check Delivery

Please enter PIN code to check delivery availability

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

Recommended for you

A handpicked list of products which has touched millions

icon
Fast Shipping

Fast Shipping On All Orders

icon
Replacement Guarantee
Easy Replacement

30 Day Money Back

icon
Online Support 24/7

Technical Support 24/7

icon
Secure Payment

All Cards Accepted