Lawler E.L. Combinatorial Optimization: Networks and Matroids

Holt, Rinehart and Winston, 1976. — 384.Combinatorial optimization problems arise everywhere, and certainly in all areas of technology and industrial management. A growing awareness of the importance of these problems has been accompanied by a combinatorial explosion In proposals for their solution.
This, book is concerned with combinatorial optimization problems which can be formulated in terms of networks and algebraic structures known as matroids. My objective has been to present a unified and fairly comprehensive survey of solution techniques for these problems, with emphasis on “augmentation” algorithms.Mathematical Preliminaries
Shortest Paths
Network Flows
Bipartite: Matching
Nonbipartite Matching
Matroids and the Greedy Algorithm
Matroid Intersections
The Matroid Parity Problem