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-XI
  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. It became a subject in its own right about 50 years ago. This book describes the most important ideas, theoretical results, and algo­ rithms in combinatorial optimization. We have conceived it as an advanced gradu­ ate text which 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. Applications and heuristics are mentioned only occasionally. Combinatorial optimization has its roots in combinatorics, operations research, and theoretical computer science. A main motivation is that thousands of real-life problems can be formulated as abstract combinatorial optimization problems. We focus on the detailed study of classical problems which occur in many different contexts, together with the underlying theory. Most combinatorial optimization problems can be formulated naturally in terms of graphs and as (integer) linear programs. Therefore this book starts, after an introduction, by reviewing basic graph theory and proving those results in linear and integer programming which are most relevant for combinatorial optimization.

Keywords

Matching Matchings algorithms approximation combinatorial optimization combinatorics complexity computer science discrete mathematics graph theory heuristics mathematics 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-21708-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-662-21710-8
  • Online ISBN 978-3-662-21708-5
  • Series Print ISSN 0937-5511
  • About this book