Papadimitriou, Christos H. <br/><br/>
Combinatorial optimization :  algorithms and complexity / 
Christos H. Papadimitriou, Kenneth Steiglitz 
 - xvi, 496 pages :  illustrations ;  22 cm 
<br/><br/> Originally published: Englewood Cliffs, N.J. : Prentice Hall, c1982. With new pref 
<br/><br/>
<br/><br/>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 
<br/><br/><label>ISBN: </label>0486402584 (pbk.) 9780486402581 (pbk.) 
<br/><br/><label>LCCN: </label>98021476 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Mathematical optimization<br/>Combinatorial optimization<br/>Computational complexity
<br/><br/><label>LC Class. No.: </label>QA402.5  / .P37 1998