Combinatorial Optimization: Algorithms and Complexity - Paperback
$21.99
$30.00
-27%Out of Stock
This product is currently out of stock. Enter your email address below to be notified once the product is back in stock
Availability:Out of StockContributor:Christos H. Papadimitriou, Kenneth SteiglitzSeries:Dover Books on Computer SciencePublish date:1998-01-29Pages:528
Languages:EnglishPublisher:Dover PublicationsISBN-13:9780486402581ISBN-10:486402584UPC:9780486402581Book Category:MathematicsBook Subcategory:CombinatoricsSize:8.47 x 5.48 x 1.04 inchesWeight:1.1707Product ID:SCP8006EYH
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.
Languages:EnglishPublisher:Dover PublicationsISBN-13:9780486402581ISBN-10:486402584UPC:9780486402581Book Category:MathematicsBook Subcategory:CombinatoricsSize:8.47 x 5.48 x 1.04 inchesWeight:1.1707Product ID:SCP8006EYH
Publisher: Dover Publications
Edition
Revised Edition
Contributor(s)
Free shipping on orders over $75. Standard shipping takes 3-7 business days. Returns accepted within 30 days of purchase.