Combinatorial optimization : algorithms and complexity /
Christos H. Papadimitriou, Kenneth Steiglitz
- Mineola, N.Y. : Dover Publications, 1998
- xvi, 496 p ill. ; 22 cm
Optimization Problems (Page-1),The Simplex Algorithm (Page-26), Duality (Page-67), Computational Considerations for the Simplex Algorithm (Page-88), The Primal Dual Algorithms (Page-104), Primal Dual Algorithms for Max Flow and Shortest Path (Page-117), Primal Dual Algorithms for Min Cost Flow (Page-137), Algorithms and Complexity (Page-156), Efficient Algorithms for the Max Flow Problems (Page-193), Algorithms for Matching (Page-218), Weighted Matching (Page-247), Spanning Trees and Matroids (Page-271), Integer Linear Programming (Page-307), A Cutting Plane Algorithms for Integer Linear Programs (Page-326), NP-Complete Problems (Page-342), More About NP-Completeness (Page-383), Approximation Algorithms (Page-406), Branch and Bound and Dynamic Programming (Page-433), Local Search (Page-454).