Combinatorial Optimization

A complete, highly accessible introduction to one of today's mostexciting areas of applied mathematics
One of the youngest, most vital areas of applied mathematics,combinatorial optimization integrates techniques fromcombinatorics, linear programming, and the theory of algorithms.Because of its success in solving difficult problems in areas fromtelecommunications to VLSI, from product distribution to airlinecrew scheduling, the field has seen a ground swell of activity overthe past decade.
Combinatorial Optimization is an ideal introduction to thismathematical discipline for advanced undergraduates and graduatestudents of discrete mathematics, computer science, and operationsresearch. Written by a team of recognized experts, the text offersa thorough, highly accessible treatment of both classical conceptsand recent results. The topics include:
* Network flow problems
* Optimal matching
* Integrality of polyhedra
* Matroids
* NP-completeness
Featuring logical and consistent exposition, clear explanations ofbasic and advanced concepts, many real-world examples, and helpful,skill-building exercises, Combinatorial Optimization is certain tobecome the standard text in the field for many years to come.