Logo - springer
Slogan - springer

New & Forthcoming Titles | Combinatorial Optimization - Theory and Algorithms

Combinatorial Optimization

Theory and Algorithms

Series: Algorithms and Combinatorics, Vol. 21

Korte, Bernhard, Vygen, Jens

Softcover reprint of hardcover 4th ed. 2008

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-3-540-71844-4

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-642-09092-9

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

  • Emphasizes theoretical results and algorithms with provably good performance
  • Offers complete but concise proofs, making it an invaluable practical tool for students
  • Fully updated third edition includes a new chapter on facility location problems

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

Content Level » Research

Keywords » Combinatorial Optimization - Mathematical Programming - algorithms - discrete algorithms - linear optimization - operations research - optimization

Related subjects » Mathematics - Operations Research & Decision Theory - Theoretical Computer Science

Table of contents 

Graphs.- Linear Programming.- Linear Programming Algorithms.- Integer Programming.- Spanning Trees and Arborescences.- Shortest Paths.- Network Flows.- Minimum Cost Flows.- Maximum Matchings.- Weighted Matching.- b-Matchings and T-Joins.- Matroids.- Generalizations of Matroids.- NP-Completeness.- Approximation Algorithms.- The Knapsack Problem.- Bin-Packing.- Multicommodity Flows and Edge-Disjoint Paths.- Network Design Problems.- The Traveling Salesman Problem.- Facility Location.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Discrete Mathematics.

Additional information