Combinatorial Optimization Algorithms and Complexity - Ebook A2
$29.99$37.49Save 20%
Description
Combinatorial Optimization
Algorithms and Complexity
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.
Important Notice:
- All products sold are digital e-books delivered in PDF or EPUB format only. No physical book will be shipped.
- By completing your purchase, you acknowledge and agree that you are purchasing a digital product, and no physical item will be delivered.
- Please carefully review this information before placing your order to avoid any misunderstanding. Due to the nature of digital products, orders are generally non-refundable once the file has been delivered or accessed, except in cases of technical error.