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.
Bu e-kitabı satın alın ve 1 tane daha ÜCRETSİZ kazanın!
Dil İngilizce ● Biçim EPUB ● Sayfalar 528 ● ISBN 9780486320137 ● Dosya boyutu 25.2 MB ● Yayımcı Dover Publications ● Yayınlanan 2013 ● İndirilebilir 24 aylar ● Döviz EUR ● Kimlik 5276827 ● Kopya koruma Adobe DRM
DRM özellikli bir e-kitap okuyucu gerektirir