Combinatorial optimization : algorithms and complexity - Papadimitriou, Christos H; Steiglitz, Kenneth, 1939- (Mineola, N.Y. : Dover Publications, 1999)
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
Originally published: Englewood Cliffs, N.J. : Prentice Hall, c1982. With new pref
Includes bibliographical references and index
Keywords: Mathematical optimization; Combinatorial optimization; Computational complexity