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.
Buy this ebook and get 1 more FREE!
Language English ● Format EPUB ● Pages 528 ● ISBN 9780486320137 ● File size 25.2 MB ● Publisher Dover Publications ● Published 2013 ● Downloadable 24 months ● Currency EUR ● ID 5276827 ● Copy protection Adobe DRM
Requires a DRM capable ebook reader