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.
Achetez cet ebook et obtenez-en 1 de plus GRATUITEMENT !
Langue Anglais ● Format EPUB ● Pages 528 ● ISBN 9780486320137 ● Taille du fichier 25.2 MB ● Maison d’édition Dover Publications ● Publié 2013 ● Téléchargeable 24 mois ● Devise EUR ● ID 5276827 ● Protection contre la copie Adobe DRM
Nécessite un lecteur de livre électronique compatible DRM