Combinatorial Optimization Algorithms And Complexity - Softcover
Book 18 of 19: Dover Books on Computer Science
Synopsis
This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses 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. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further." — American Mathematical Monthly.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Combinatorial Optimization Algorithms And Complexity
Seller Image
Combinatorial Optimization Algorithms And Complexity
Published by
Prentice Hall of India Private Ltd
ISBN 10: 8120311396
ISBN 13: 9788120311398
Used
Softcover
Seller: Bay State Book Company, North Smithfield, RI, U.S.A.
Seller rating 5 out of 5 stars
Condition: good. The book is in good condition with all pages and cover intact, including the dust jacket if originally issued. The spine may show light wear. Pages may contain some notes or highlighting, and there might be a "From the library of" label. Boxed set packaging, shrink wrap, or included media like CDs may be missing. Seller Inventory # BSM.TQ5D