## Find a copy online

### Links to this item

link.springer.com Springer eBooks (Mathematics and Statistics 2008)

Show all links

## Find a copy in the library

Finding libraries that hold this item...

## Details

Genre/Form: | Electronic books |
---|---|

Additional Physical Format: | Print version: Korte, B.H. (Bernhard H.), 1938- Combinatorial optimization. Berlin : Springer, ©2008 (DLC) 2007936375 (OCoLC)181087916 |

Material Type: | Document, Internet resource |

Document Type: | Internet Resource, Computer File |

All Authors / Contributors: |
B H Korte; Jens Vygen |

ISBN: | 9783540718444 3540718443 3540718435 9783540718437 |

OCLC Number: | 261324708 |

Description: | 1 online resource (xvii, 627 pages) : illustrations. |

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. |

Series Title: | Algorithms and combinatorics, 21. |

Responsibility: | Bernhard Korte, Jens Vygen. |

More information: |

### Abstract:

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.

## Reviews

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "Combinatorial optimization : theory and algorithms".
Be the first.