Combinatorial Optimization [Hardcover]

William J. Cook (Author), William H. Cunningham (Author), William R. Pulleyblank (Author), Alexander Schrijver (Author)

Book Description

Publication Date: November 12, 1997 | ISBN-10: 047155894X | ISBN-13: 978-0471558941 | Edition: 1

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.

Editorial Reviews

From the Publisher

Combinatorial optimization is a lively field of applied mathematics, combining techniques from combinatorics, linear programming, and the theory of algorithms, to solve optimization problems over discrete structures. This new treatment of the subject covers some of the advances that have been made in the past decade. Subjects include the theory, algorithms, and applications of this relatively young area in a manner accessible to senior and graduate students in mathematics and computer science.

From the Back Cover

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.

See all Editorial Reviews

Product Details

• Hardcover: 368 pages
• Publisher: Wiley-Interscience; 1 edition (November 12, 1997)
• Language: English
• ISBN-10: 047155894X
• ISBN-13: 978-0471558941
• Product Dimensions: 9.5 x 6.1 x 0.9 inches
• Shipping Weight: 1.4 pounds (View shipping rates and policies)
• Average Customer Review: 4.8 out of 5 stars  See all reviews (4 customer reviews)
• Amazon Best Sellers Rank: #898,094 in Books (See Top 100 in Books)

More About the Author

William Cook is the Chandler Family Professor at Georgia Tech and a member of the National Academy of Engineering. Together with David Applegate, Robert Bixby, and Vasek Chvatal, Cook created the Concorde computer code for the traveling salesman problem.

Customer Reviews

Most Helpful Customer Reviews

14 of 14 people found the following review helpful:

5.0 out of 5 stars A Classic in Combinatorial Optimization, March 18, 2003

By 

Fred Rispoli (Dowling College, Oakdale, NY United States) - See all my reviews

This review is from: Combinatorial Optimization (Hardcover)

Combinaorial Optimization is one of those rare books that is an instant classic. The authors weave a readable fabric of intuition and theory that is unmatched in this exciting discipline. The choice of topics covered begins with two fundamental optimization problems, namely, the minimum spanning tree and shortest path problems. Next, maximum flow and minimum cost flow problems are discussed, followed by matching problems, polyhedral issues arising in combinatorial optimization, and the famous traveling salesman problem. The text concludes with chapters on matroids and NP-Completeness. The exposition on these topics is very well written and the proofs are rigorous. There is a terrific blend of theory, algorithms and applications without overwhelming the reader with computational details. The authors also do a good job of developing an accurate historical perspective of the material, most of which evolved during the time period 1955 to 1995. The book is suitable for an upper-level undergraduate, or a graduate course. The exercises are very well thought out and are at an appropriate level. I have taught undergraduate courses in combinatorial optimization for over 10 years and have always struggled to find an appropriate text. My problem has now been solved.

5 of 11 people found the following review helpful:

5.0 out of 5 stars Elegant one, but not a lot of details., September 29, 1999

By A Customer

This review is from: Combinatorial Optimization (Hardcover)

This book was thoroughly written by great-minded Masters. It is well-organized in their topics and presentation. However, the book details is unbalnced, some chapters are overwhelm the data, and some others are insufficient. By the way, I graded this book a Very Good one. Worth Reading !!

5 of 13 people found the following review helpful:

5.0 out of 5 stars A superb introduction to Combinatorial Optimisation, July 16, 1999

By 

KARTIK KRISHNAN S. - See all my reviews

This review is from: Combinatorial Optimization (Hardcover)

A good introduction to Combinatorial optimisation and integer programming.

Especially recommended are the chapters on minimum weight matching and the TSP.