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.
قم بشراء هذا الكتاب الإلكتروني واحصل على كتاب آخر مجانًا!
لغة الإنجليزية ● شكل EPUB ● صفحات 528 ● ISBN 9780486320137 ● حجم الملف 25.2 MB ● الناشر Dover Publications ● نشرت 2013 ● للتحميل 24 الشهور ● دقة EUR ● هوية شخصية 5276827 ● حماية النسخ Adobe DRM
يتطلب قارئ الكتاب الاليكتروني قادرة DRM