Combinatorial Optimization: Algorithms And Complexity

$346.90 New In stock Publisher: PRENTICE HALL
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.

Qty:
   - OR -   
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
AuthorPapadimitriou, Christos H.
Bindinghardcover
Languageenglish
EditionFirst Edition
ISBN-100131524623
ISBN-139780131524620
Publisher
Publication Year1981T

Write a review


Your Name:


Your Email:


Your Review:

Note: HTML is not translated!

Rating: Bad           Good

Enter the code in the box below: