Combinatorial Optimization: Algorithms and Complexity [Hardcover - Used]

Combinatorial Optimization: Algorithms and Complexity [Hardcover - Used]
Combinatorial Optimization: Algorithms and Complexity [Hardcover - Used]
(1) 1 shops 0 products

Detailed product description

CONDITION - USED - Pages can include limited notes and highlighting, and the copy can include "From the library of" labels or previous owner inscriptions. Accessories such as CD, codes, toys, may not be included. 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.

Combinatorial Optimization: Algorithms and Complexity [Hardcover - Used]

Compare buying offers

Search
Amazon Amazon
Currently Unavailable - Out of Stock

We don't know when or if this item will be back in stock. Please check back later for updates.

Product specifications

Technical details

Manufacturer -
Brand Prentice Hall PTR
Item model number -
Color -
Weight -
Height -
Depth -

Additional product information

Product Id 533090
User Reviews and Ratings 3 (1 ratings) 3 out of 5 stars
UPC 468085076479

Compare buying offers

# Title Reviews User Ratings Price
1
Search on Amazon
Price:
Search on Amazon
Search on Amazon

Similar Products View All

arrow_upward