Papadimitriou, Christos H. <br/><br/>
Combinatorial optimization: algorithms and complexity 

 - New York  Dover Publication, Inc.  1998 
 - xvi, 496 p. 
<br/><br/> This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further." — American Mathematical Monthly. 
<br/><br/><label>ISBN: </label>9780486402581 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Mathematical optimization<br/>Computational complexity<br/>Combinatorial optimization<br/>Combinatorial analysis
<br/><br/><label>Dewey Class. No.: </label>511.6  / PAP