Book is shelf-cocked. Otherwise, fine. Open Books is a nonprofit social venture that provides literacy experiences for thousands of readers each year through inspiring programs and creative capitalization of books.

Seller Inventory # mon0000805365

Contact seller

Report this item

Bibliographic Details

Title: Combinatorial Optimization: Algorithms and Complexity
Publisher: Prentice Hall
Publication Date: 1981
Language: English
ISBN 10: 0131524623
ISBN 13: 9780131524620
Binding: hardcover
Condition: Good

About this title

Synopsis

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.

"About this title" may belong to another edition of this title.

Store Description

Open Books is a nonprofit social venture that provides literacy experiences for thousands of readers each year through inspiring programs and creative capitalization of books. We are a 501(c)3 with all proceeds going to our literacy enrichment programs.

Visit Seller's Storefront

Seller's business information

Open Books, Ltd.
651 W. Lake St., Chicago, IL, 60661, U.S.A.

Sale & Shipping Terms

Terms of Sale

All items subject to prior sale. Refunds and returns within 30 days of shipment with authorization.

Shipping Terms

All orders ship within 2 business days. Most domestic orders shipped with USPS Bound Printed Matter with delivery confirmation, delivery within 2 weeks. Expedited orders ship via USPS Priority Mail. International Orders ship via USPS International Prioriry, delivery between 7-21 business days. Standard international shipping is expedited service.