Home › Science & Math Books › Combinatorial Optimization: Algorithms and Complexity

1 1

Combinatorial Optimization: Algorithms and Complexity

Name: Combinatorial Optimization: Algorithms and Complexity
Brand: Prentice Hall
SKU: ByrdShop_0131524623
Price: 186.80 USD
Availability: InStock

hardcover – January 1, 1981

by Papadimitriou, Christos H.

$186.80 USD

Sale Sold out

Shipping calculated at checkout.

Quantity

Secure Checkout

Quality Guaranteed

New In Stock

ISBN-13: 9780131524620 ISBN-10: 0131524623

Publisher

Prentice Hall

Binding

hardcover

Published

January 1, 1981

Weight

1.8 lbs

Dimensions

0.00×0.00×0.00 cm

About this book

Combinatorial Optimization: Algorithms and Complexity by Papadimitriou, Christos H.. hardcover edition. ISBN: 9780131524620.

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.