A complete, highly accessible introduction to one of today's most exciting areas of applied mathematics

One of the youngest, most vital areas of applied mathematics, combinatorial optimization integrates techniques from combinatorics, linear programming, and the theory of algorithms. Because of its success in solving difficult problems in areas from telecommunications to VLSI, from product distribution to airline crew scheduling, the field has seen a ground swell of activity over the past decade.

Combinatorial Optimization is an ideal introduction to this mathematical discipline for advanced undergraduates and graduate students of discrete mathematics, computer science, and operations research. Written by a team of recognized experts, the text offers a thorough, highly accessible treatment of both classical concepts and recent results. The topics include:

* Network flow problems

* Optimal matching

* Integrality of polyhedra

* Matroids

* NP-completeness

Featuring logical and consistent exposition, clear explanations of basic and advanced concepts, many real-world examples, and helpful, skill-building exercises, Combinatorial Optimization is certain to become the standard text in the field for many years to come.

William J. Cook 現任美國佐治亞理工學院教授, 1983 年獲得加拿大滑鐵盧大學博士學位, 1998 年被邀請在國際數學傢大會上作45 分鍾報告, 2003 年、2004年、2009 年分彆擔任Beale-Orchard-Hays 奬、George Polya 奬、Fulkerson 奬的評審主席. 主要研究領域為整數規劃與組閤優化, 所齣版的專著《The TravelingSalesman Problem: A Computational Study》於2007 年獲Lanchester 奬.William H. Cunningham 現任加拿大滑鐵盧大學數學係教授, 1971 年獲得博士學位, 主要研究領域為組閤優化.