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

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Papadimitriou, Christos H.
Otros Autores: Steiglitz, Kenneth
Formato: Libro
Lenguaje:Vietnamese
Publicado: New York Dover Publications, Inc. 1998
Materias:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Thư viện lưu trữ: Thư viện Trường Đại học Nam Cần Thơ
Descripción
Sumario: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.
Descripción Física:xvi, 496 p. ill. 22cm
Bibliografía:Includes bibliographical references and index
ISBN:9780486402581