Computational Combinatorial Optimization

Optimal or Provably Near-Optimal Solutions

  • Michael Jünger
  • Denis Naddef

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2241)

Table of contents

  1. Front Matter
    Pages I-I
  2. Claude Lemaréchal
    Pages 112-156
  3. Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi
    Pages 157-222
  4. Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr
    Pages 223-260
  5. David Applegate, Robert Bixby, Vašek Chvátal, William Cook
    Pages 261-303
  6. Back Matter
    Pages 305-305

About this book


This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.


Branch and Cut Algorithms Combinatorial Optimization Computational Combinatorial Optimization Discrete Computations Discrete Structures Optimization Algorithms Polyhedral Combinatorics Traveling Salesman Problem (TSP) algorithms modeling optimization programming

Editors and affiliations

  • Michael Jünger
    • 1
  • Denis Naddef
    • 2
  1. 1.Universität zu Köln,Institut für InformatikKölnGermany
  2. 2.ENSIMAG - antenne de Montbonnot Laboratoire Informatique et Distribution, ZIRSTMontbonnot Saint MartinFrance

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42877-0
  • Online ISBN 978-3-540-45586-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site