a b c d e f g h i j k l m n o p q r s t u v w x y z    0 1 2 3 4 5 6 7 8 9 
а б в г д е ж з и й к л м н о п р с т у ф х ц ч ш щ ъ ы ь э ю я 

Скачать Combinatorial Optimization: Algorithms and Complexity бесплатно

Combinatorial Optimization: Algorithms and Complexity

Christos H. Papadimitriou, «Combinatorial Optimization: Algorithms and Complexity»
Dover Publications| ISBN: 0486402584 | 1998-01-29 | DJVU | 512 pages | 19.32MB

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. 1982 ed.




Посетители, находящиеся в группе Гости, не могут оставлять комментарии в данной новости.