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.
€20.99
यह ईबुक खरीदें और 1 और मुफ़्त पाएं!
भाषा अंग्रेज़ी ● स्वरूप EPUB ● पेज 528 ● ISBN 9780486320137 ● फाइल का आकार 25.2 MB ● प्रकाशक Dover Publications ● प्रकाशित 2013 ● डाउनलोड करने योग्य 24 महीने ● मुद्रा EUR ● आईडी 5276827 ● कॉपी सुरक्षा Adobe DRM
एक DRM सक्षम ईबुक रीडर की आवश्यकता है
एक ही लेखक से अधिक ईबुक / संपादक
50,053 इस श्रेणी में ईबुक
