Combinatorial Optimization: Algorithms and Complexity ler

Isbn 10: 0486402584

Isbn 13: 9780486402581

txt Combinatorial Optimization: Algorithms and Complexity

por

Escolha um formato:

Escolha um formato:

zip ler
rar ler
pdf ler
epub ler
txt ler
djvu ler

Descrição do livro

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.

Número de páginas :496
Isbn 10 :0486402584
Isbn 13 :9780486402581
Encadernação :Capa Comum
Edição Combinatorial Optimization: Algorithms and Complexity:Revised ed.