Combinatorial Optimization: Algorithms and Complexity

Main
Mathematics - Optimization. Operations Research
Combinatorial Optimization: Algorithms...

Combinatorial Optimization: Algorithms and Complexity

Name: Combinatorial Optimization: Algorithms and Complexity
ISBN: 9780486402581

Christos H. Papadimitriou, Kenneth Steiglitz

5.0 / 3.0

0 comments

آپ کو یہ کتاب کتنی پسند ہے؟

فائل کی کوالٹی کیا ہے؟

کوالٹی کا جائزہ لینے کے لیے کتاب ڈاؤن لوڈ کریں

فائل کی کوالٹی کیا ہے؟

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.

سب زمرہ:

Mathematics - Optimization. Operations Research

جلد:

سال:

1998

اشاعت:

ناشر کتب:

Prentice Hall

زبان:

english

صفحات:

528