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. "e;Mathematicians wishing a self-contained introduction need look no further."e; — American Mathematical Monthly.
| ISBN: | 9780486320137 |
| Publication date: | 26th April 2013 |
| Author: | Papadimitriou, Christos H.|Steiglitz, Kenneth |
| Publisher: | Dover Publications |
| Format: | Ebook |
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.
Ebook, Paperback. £21.95. Digital. Available Immediately. Country restrictions apply..
Combinatorial Optimization was written by Papadimitriou, Christos H.|Steiglitz, Kenneth and published by Dover Publications
£21.95. Digital. Available Immediately. Country restrictions apply..