Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. Recent topics are covered as well, and numerous references are provided.

From the Back Cover:

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. It contains complete but concise proofs, also for many deep results, some of which did not appear in a textbook before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization.

This fourth edition is again significantly extended, most notably with new material on linear programming, the network simplex algorithm, and the max-cut problem. Many further additions and updates are included as well.

From the reviews of the previous editions:

"This book on combinatorial optimization is a beautiful example of the ideal textbook."

Operations Research Letters 33 (2005), p.216-217

"The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization."

OR News 19 (2003), p.42

"... has become a standard textbook in the field."

Zentralblatt MATH 1099.90054

"About this title" may belong to another edition of this title.

Store Description

Quality books, speedy shipping, and great customer service! Please note that used items may not include access codes or cards, CD's or other accessories, regardless of what is stated in item title. If you need to guarantee that these items are included, please purchase a brand new copy.

Visit Seller's Storefront

Seller's business information

J2B Holdings, LLC
13770 NOEL RD, #803600, Dallas, TX, 75240, U.S.A.

Terms of Sale:

We guarantee the condition of every book as it's described on the AbeBooks web
sites. Please note that used items may not include access codes or cards, CD's
or other accessories, regardless of what is stated in item title. If you need to
guarantee that these items are included, please purchase a brand new copy.

All requests for refunds and/or returns will be processed in accordance with
AbeBooks policies. If you're dissatisfied with your purchase (Incorrect Book/Not
as Described/Damaged) or if ...

More Information

Shipping Terms:

Books ordered via expedited shipping should arrive between 2 and 7 business days after shipment confirmation. Books ordered via standard shipping should arrive between 4 and 14 business days after shipment confirmation.

Payment Methods
accepted by seller

Add to Wants

Items related to Combinatorial Optimization: Theory and Algorithms (Algorithm...

Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)

Korte, Bernhard; Vygen, Jens

New - Soft cover

Seller's business information