About this title: 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.
Note: This is a general synopsis. Each listing is described below.
Binding: Paperback
Publisher: Dover Publications
Date Published: 1998-01-29
ISBN-13:9780486402581ISBN:0486402584
Description: Very Good. Not pretty but still very readable. Pages are clean and unmarked. Soft cover binding is secure. Cover has very heavy wear and is also stained. Orders packed carefully and shipped daily with tracking # emailed to you. read more
Binding: Softcover
Publisher: Dover Pubns
Date Published: 1998-01-29
ISBN-13:9780486402581ISBN:0486402584
Description: NEW. Softcover. From an inventory that is 100% brand-new, 100% direct from the publishers' distribution channel. We carry NO pre-owned, NO remaindered. We pack in CARDBOARD to ensure the pristine quality is maintained. (Bubble-wrap alone is NOT sufficient to protect from USPS equipment. ) Guaranteed brand-NEW, protected with CARDBOARD, your satisfaction is guaranteed. BKLUVID: 9780486402581. read more
Description: Fine. 0131524623 LIKE NEW Condition **HARDCOVER**--note! Corner clipped. Exactly as pictured--EXACT ISBN MATCH--UNREAD-PERFECT-Still Gift Quality-No Shelf wear. No Creasing, No personalizations, No marks in the text at all. Tight and Super Clean and Neat. Not a Remainder-Ships Quickly-IN STOCK-Satisfaction guaranteed! read more
Description: Near Fine with no DJ. 0131524623. Highlighting on first 30 pages, very tight binding, shows slight shelf wear. Has had little use.; 6 1/4 " by 9 1/4 "Tall. read more
Binding: Hardcover
Publisher: Prentice Hall, Englewood Cliffs, N. J.
Date Published: 1982
ISBN-13:9780131524620ISBN:0131524623
Description: VG. Minor edge wear. Previous owner's stamp on front end paper. Mild soiling at page edges. Pages clean, binding solid.; 496 pages. read more
Description: New. 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 se... read more
Binding: Hardcover
Publisher: Prentice Hall
Date Published: 1981
ISBN-13:9780131524620ISBN:0131524623
Description: Very Good with no dust jacket. 0131524623. Minor wear, pictorial binding, pages are tight, text clean, book in VERY GOOD condition! ; 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 ... read more
Binding: Hardcover
Publisher: Prentice Hall
Date Published: 1981-09
ISBN-13:9780131524620ISBN:0131524623
Description: Good. Excellent customer service. May ship from alternate location depending on your zip code and availability. Satisfaction guaranteed! ! read more
Description: Very Good. No Jacket. 8vo-over 7¾"-9¾" tall. Very good plus condition hardcover book. Ex library with usual library notations, stamps, Top corners are lightly bumped. The book is tightly bound and square. The body of the book is notation free. The corners are sharp. 496 pages. A tightly bound, clean book. NO dust jacket-glossy pictorial cover. read more
We guarantee every item's condition, as described on Alibris. If you are not satisfied that an item is as described, return your purchase for a refund.
rating
