Combinatorial optimization : algorithms and complexity / Christos H. Papadimitriou, Kenneth Steiglitz

By: Papadimitriou, Christos HContributor(s): Steiglitz, Kenneth [aut]Publisher: Mineola, N.Y. : Dover Publications, 1998Description: xvi, 496 p ill. ; 22 cmISBN: 8120311396Subject(s): Combinatorial optimization | Computational complexity | Mathematical optimizationDDC classification: 519.3, PAP
Contents:
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).
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Home library Shelving location Call number URL Status Date due Barcode Item holds
Book Book Military College of Signals (MCS)
Military College of Signals (MCS)
General Stacks 519.3, PAP (Browse shelf) Link to resource Available MCS31797
Total holds: 0

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

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer

© 2023 Central Library, National University of Sciences and Technology. All Rights Reserved.