Combinatorial Optimization

Theory and Algorithms

Part of the Algorithms and Combinatorics 21 book series (AC, volume 21)

Table of contents

  1. Front Matter
    Pages I-XV
  2. Pages 1-12
  3. Pages 13-47
  4. Pages 49-64
  5. Pages 91-117
  6. Pages 143-156
  7. Pages 157-189
  8. Pages 191-213
  9. Pages 215-244
  10. Pages 245-270
  11. Pages 271-289
  12. Pages 291-321
  13. Pages 343-375
  14. Pages 377-413
  15. Pages 415-424
  16. Pages 426-441

About this book

Introduction

This comprehensive textbook on combinatorial optimization puts 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. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete but concise proofs, also for many deep results, some of which did not appear in a book 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 third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added.

From the reviews of the 2nd edition:

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

Operations Resarch 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 

 

 

 

 

Keywords

Discrete Algorithms Matching Matchings algorithms combinatorial optimization linear optimization mathematical programming optimization

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-29297-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-540-25684-7
  • Online ISBN 978-3-540-29297-5
  • Series Print ISSN 0937-5511
  • About this book
Industry Sectors
Finance, Business & Banking
Oil, Gas & Geosciences