Combinatorial Optimization : Algorithms and complexity

This book 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...

Celý popis

Uloženo v:
Podrobná bibliografie
Hlavní autor: Papadimitriou, Christos H.
Další autoři: Steiglitz, Kenneth
Médium: Kniha
Jazyk:Vietnamese
Vydáno: New York Dover Publications, Inc. 1998
Témata:
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
Thư viện lưu trữ: Thư viện Trường Đại học Nam Cần Thơ
Popis
Shrnutí:This book 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.
Fyzický popis:xvi, 496 p. ill. 22cm
Bibliografie:Includes bibliographical references and index
ISBN:9780486402581