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.
购买此电子书可免费获赠一本!
语言 英语 ● 格式 EPUB ● ISBN 9780486320137 ● 出版者 Dover Publications ● 发布时间 2013 ● 下载 3 时 ● 货币 EUR ● ID 5276827 ● 复制保护 Adobe DRM
需要具备DRM功能的电子书阅读器