Combinatorial Optimization: Algorithms and Complexity - Paperback
$30.00
Skip to product information
Combinatorial Optimization: Algorithms and Complexity - Paperback
$30.00
by Christos H. Papadimitriou (Author), Kenneth Steiglitz (Author)
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.
Number of Pages: 528
Dimensions: 1.04 x 8.47 x 5.48 IN
Publication Date: January 29, 1998
Details
This product is crafted with quality materials to ensure durability and performance. Designed with your convenience in mind, it seamlessly fits into your everyday life.
Shipping & Returns
We strive to process and ship all orders in a timely manner, working diligently to ensure that your items are on their way to you as soon as possible.
We are committed to ensuring a positive shopping experience for all our customers. If for any reason you wish to return an item, we invite you to reach out to our team for assistance, and we will evaluate every return request with care and consideration.
