Combinatorial optimization: algorithms and complexity
Material type:
TextPublication details: New York Dover Publication, Inc. 1998 Description: xvi, 496 pISBN: 9780486402581Subject(s): Mathematical optimization | Computational complexity | Combinatorial optimization | Combinatorial analysisDDC classification: 511.6 Summary: 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.
| Item type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
Book
|
Indian Institute of Management LRC General Stacks | Operations Management & Quantitative Techniques | 511.6 PAP (Browse shelf(Opens below)) | 1 | Available | 001430 |
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.
There are no comments on this title.