Combinatorial Optimization / Edition 1

Hardcover (Print)
Buy New
Buy New from
Buy Used
Buy Used from
(Save 41%)
Item is in good condition but packaging may have signs of shelf wear/aging or torn packaging.
Condition: Used – Good details
Used and New from Other Sellers
Used and New from Other Sellers
from $44.62
Usually ships in 1-2 business days
(Save 76%)
Other sellers (Hardcover)
  • All (12) from $44.62   
  • New (4) from $167.78   
  • Used (8) from $44.62   


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.
Read More Show Less

Editorial Reviews

An introduction to combinatorial optimization for advanced undergraduates and graduate students of discrete mathematics, computer science, and operations research. Covers both classical concepts and recent results, with chapters on areas such as optimal trees and paths, maximum flow problems, integrality of polyhedra, the traveling salesman problem, and matroids. Contains more material than can be covered in a single course. Learning features include logical and consistent exposition, real-world examples, and chapter exercises. Familiarity with linear programming duality is helpful, although a background appendix on this subject is provided. Annotation c. by Book News, Inc., Portland, Or.
Read More Show Less

Product Details

Meet the Author

WILLIAM J. COOK is a professor in the Department of Computational and Applied Mathematics at Rice University. WILLIAM H. CUNNINGHAM is a professor in the Department of Combinatorics and Optimization at the University of Waterloo. WILLIAM R. PULLEYBLANK is Director of Mathematical Sciences at IBM Watson Research in Yorktown Heights, New York. ALEXANDER SCHRIJVER is a department head at the Centrum voor Wiskunde en Informatica, with a joint appointment as a professor at the University of Amsterdam.
Read More Show Less

Table of Contents

1 Problems and Algorithms 1
2 Optimal Trees and Paths 9
3 Maximum Flow Problems 37
4 Minimum-Cost Flow Problems 91
5 Optimal Matchings 127
6 Integrality of Polyhedra 199
7 The Traveling Salesman Problem 241
8 Matroids 273
9 NP and NP-Completeness 309
App. A Linear Programming 325
Bibliography 337
Index 347
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)