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.
"synopsis" may belong to another edition of this title.
Book Description Prentice Hall. Hardcover. Book Condition: New. 0131524623 New Condition. Bookseller Inventory # NEW4.0047792
Book Description Prentice Hall, 1981. Hardcover. Book Condition: New. Bookseller Inventory # P110131524623
Book Description Prentice Hall, 1981. Book Condition: New. Brand New, Unread Copy in Perfect Condition. A+ Customer Service!. Bookseller Inventory # ABE_book_new_0131524623
Book Description Prentice Hall, 1981. Hardcover. Book Condition: New. Bookseller Inventory # DADAX0131524623