Normal görünüm MARC görünümü ISBD görünümü

Papadimitriou, Christos H

Combinatorial optimization : algorithms and complexity / Christos H. Papadimitriou, Kenneth Steiglitz - xvi, 496 pages : illustrations ; 22 cm

Originally published: Englewood Cliffs, N.J. : Prentice Hall, c1982. With new pref

Includes bibliographical references and index

Optimization problems --Simplex algorithm --Duality --Computational considerations for the simplex algorithm --Primal-dual algorithm --Primal-dual algorithms for max-flow and shortest path: ford-fulkerson and dijkstra --Primal-dual algorithms for min-cost flow --Algorithms and complexity --Efficient algorithms for the max-flow problem --Algorithms for matching --Weighted matching --Spanning trees and matroids --Integer linear programming --A cutting-plane algorithm for integer linear programs --NP-complete problems --More about NP-completeness --Approximation algorithms --Branch-and-bound and dynamic programming --Local search

ISBN: 0486402584

LCCN: 98021476

Subjects--Topical Terms:
Mathematical optimization
Combinatorial optimization
Computational complexity

LC Class. No.: QA402.5 / .P37 1999

Dewey Class. No.: