Combinatorial Optimization

Theory and Algorithms

  • Bernhard Korte
  • Jens Vygen

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

Table of contents

  1. Front Matter
    Pages I-XIII
  2. Bernhard Korte, Jens Vygen
    Pages 1-12
  3. Bernhard Korte, Jens Vygen
    Pages 13-47
  4. Bernhard Korte, Jens Vygen
    Pages 49-64
  5. Bernhard Korte, Jens Vygen
    Pages 65-90
  6. Bernhard Korte, Jens Vygen
    Pages 91-116
  7. Bernhard Korte, Jens Vygen
    Pages 117-137
  8. Bernhard Korte, Jens Vygen
    Pages 139-152
  9. Bernhard Korte, Jens Vygen
    Pages 153-184
  10. Bernhard Korte, Jens Vygen
    Pages 185-204
  11. Bernhard Korte, Jens Vygen
    Pages 205-233
  12. Bernhard Korte, Jens Vygen
    Pages 235-260
  13. Bernhard Korte, Jens Vygen
    Pages 261-278
  14. Bernhard Korte, Jens Vygen
    Pages 279-309
  15. Bernhard Korte, Jens Vygen
    Pages 311-326
  16. Bernhard Korte, Jens Vygen
    Pages 327-359
  17. Bernhard Korte, Jens Vygen
    Pages 361-396
  18. Bernhard Korte, Jens Vygen
    Pages 397-406
  19. Bernhard Korte, Jens Vygen
    Pages 407-422
  20. Bernhard Korte, Jens Vygen
    Pages 423-444

About this book

Introduction

Combinatorial optimization is one of the youngest and most active areas of discrete mathematics, and is probably its driving force today. This book describes the most important ideas, theoretical results, and algorithms of this field. It is conceived as an advanced graduate text, and it can also be used as an up-to-date reference work for current research. The book includes the essential fundamentals of graph theory, linear and integer programming, and complexity theory. It covers classical topics in combinatorial optimization as well as very recent ones. The emphasis is on theoretical results and algorithms with provably good performance. Some applications and heuristics are mentioned, too.

Keywords

Discrete Algorithms Matching Matchings Mathematica Mathematical Programming algorithms approximation combinatorial optimization heuristics linear optimization operations research optimization programming

Authors and affiliations

  • Bernhard Korte
    • 1
  • Jens Vygen
    • 1
  1. 1.Research Institute for Discrete MathematicsUniversity of BonnBonnGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-662-21711-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-662-21713-9
  • Online ISBN 978-3-662-21711-5
  • Series Print ISSN 0937-5511
  • About this book
Industry Sectors
Finance, Business & Banking
Oil, Gas & Geosciences