Combinatorial Optimization : Algorithms and Complexity
Book Details
Format
Paperback / Softback
Book Series
Dover Books on Computer Science
ISBN-10
0486402584
ISBN-13
9780486402581
Publisher
Dover Publications Inc.
Imprint
Dover Publications Inc.
Country of Manufacture
US
Country of Publication
GB
Publication Date
Feb 1st, 2000
Print length
528 Pages
Weight
644 grams
Dimensions
21.40 x 13.60 x 2.60 cms
Product Classification:
OptimizationCombinatorics & graph theory
Ksh 4,500.00
Werezi Extended Catalogue
Delivery in 14 days
4 copies in stock
Delivery Location
Delivery fee: Select location
Delivery in 14 days
Secure
Quality
Fast
This 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; local search heuristics for NP-complete problems, more. 1982 edition.
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.
Get Combinatorial Optimization by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Dover Publications Inc. and it has pages.