Your shopping cart is empty!
Combinatorial Optimization: Algorithms And Complexity
Publisher: PRENTICE HALL
SKU: DADAX0131524623
Condition : New
SKU: DADAX0131524623
Condition : New
Price:
$346.90
Shipping & Tax will be calculated at Checkout.
US Delivery Time: 3-5 Business Days.
Outside US Delivery Time: 8-12 Business Days.
Combinatorial Optimization: Algorithms and Complexity
Features of Combinatorial Optimization: Algorithms and Complexity
Clearly written graduate-level text considers 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. Mathematicians wishing a self-contained introduction need look no further. American Mathematical Monthly. 1982 edition.
Specification of Combinatorial Optimization: Algorithms and Complexity
GENERAL | |
---|---|
Author | Papadimitriou, Christos H. |
Binding | hardcover |
Language | english |
Edition | First Edition |
ISBN-10 | 0131524623 |
ISBN-13 | 9780131524620 |
Publication Year | 1981T |
Write a review
Your Name:
Your Email:
Your Review:
Note: HTML is not translated!
Rating: Bad Good
Enter the code in the box below: