|
![]() |
|||
|
||||
Overview"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." Full Product DetailsAuthor: Christos H. Papadimitriou , Kenneth SteiglitzPublisher: Dover Publications Inc. Imprint: Dover Publications Inc. Edition: New edition Dimensions: Width: 14.10cm , Height: 2.70cm , Length: 21.60cm Weight: 0.625kg ISBN: 9780486402581ISBN 10: 0486402584 Pages: 528 Publication Date: 01 February 2000 Audience: College/higher education , Professional and scholarly , Undergraduate , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |