Korte, B. H.  1938- <br/><br/>
Combinatorial optimization:  theory and algorithms/ 
Bernhard Korte, Jens Vygen. 
 - 2nd ed. 
 - Berlin;  New York:  Springer,  c2002. 
 - xiii, 530 p.:  ill.;  25 cm. 
 - Algorithms and combinatorics;  21 .
<br/><br/>Includes bibliographical references and indexes. 
<br/><br/>Graphs -- Linear programming -- Linear programming algorithms -- Integer programming -- Spanning trees and arborescences -- Shortest paths -- Network flows -- Minimum cost flows -- Maximum matchings -- Weighted matching -- B-matchings and T-joins -- Matroids -- Generalizations of matroids -- NP-completeness -- Approximation algorithms -- The knapsack problem -- Bin-packing -- Multicommodity flows and edge-disjoint paths -- Network design problems -- The traveling salesman problem . 
<br/><br/><label>ISBN: </label>3540431543 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Combinatorial optimization.
<br/><br/><label>Dewey Class. No.: </label>519.3  / K85c