Description: 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.
Price: 10.11 USD
Location: Ogden, Utah
End Time: 2024-09-18T18:43:37.000Z
Shipping Cost: N/A USD
Product Images
Item Specifics
Restocking Fee: No
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
Book Title: Combinatorial Optimization : Algorithms and Complexity
Publication Name: Combinatorial Optimization : Algorithms and Complexity
Item Length: 8.5in.
Publisher: Dover Publications, Incorporated
Series: Dover Books ON Computer Science Ser.
Publication Year: 1998
Type: Textbook
Format: Trade Paperback
Language: English
Item Height: 1in.
Author: Kenneth Steiglitz, Christos H. Papadimitriou
Item Width: 5.5in.
Item Weight: 18.5 Oz
Number of Pages: 528 Pages
