Research Trends in Combinatorial Optimization

Bonn 2008

  • William Cook
  • László Lovász
  • Jens Vygen

Table of contents

  1. Front Matter
    Pages i-xviii
  2. Mourad Baïou, Francisco Barahona
    Pages 1-31
  3. Sylvia Boyd, William R. Pulleyblank
    Pages 33-55
  4. Vašek Chvátal
    Pages 57-64
  5. Jack Edmonds
    Pages 65-68
  6. András Frank, Tamás Király
    Pages 87-126
  7. Satoru Fujishige
    Pages 127-162
  8. Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
    Pages 163-183
  9. T. C. Hu, Leo Landa, Man-Tak Shing
    Pages 201-217
  10. Guyslain Naves, András Sebő
    Pages 261-283
  11. Jaroslav Nešetřil
    Pages 285-302
  12. Yves Pochet, Mathieu Van Vyve, Laurence A. Wolsey
    Pages 317-346
  13. András Recski
    Pages 387-398

About this book

Introduction

The editors and authors dedicate this book to Bernhard Korte on the occasion of his seventieth birthday. We, the editors, are happy about the overwhelming feedback to our initiative to honor him with this book and with a workshop in Bonn on November 3–7,2008.Althoughthiswouldbeareasontolookback,wewouldratherliketolook forward and see what are the interesting research directions today. This book is written by leading experts in combinatorial optimization. All - pers were carefully reviewed, and eventually twenty-three of the invited papers were accepted for this book. The breadth of topics is typical for the eld: combinatorial optimization builds bridges between areas like combinatorics and graph theory, submodular functions and matroids, network ows and connectivity, approximation algorithms and mat- matical programming, computational geometry and polyhedral combinatorics. All these topics are related, and they are all addressed in this book. Combi- torial optimization is also known for its numerous applications. To limit the scope, however, this book is not primarily about applications, although some are mentioned at various places. Most papers in this volume are surveys that provide an excellent overview of an activeresearcharea,butthisbookalsocontainsmanynewresults.Highlightingmany of the currently most interesting research directions in combinatorial optimization, we hope that this book constitutes a good basis for future research in these areas.

Keywords

Partition algorithms calculus combinatorial optimization combinatorics complexity discrete mathematics mathematical programming mathematics of computing operations research optimization theoretical computer science

Editors and affiliations

  • William Cook
    • 1
  • László Lovász
    • 2
  • Jens Vygen
    • 3
  1. 1.Industrial and Systems EngineeringGeorgia TechAtlantaUSA
  2. 2.Institute of MathematicsEötvös Loránd UniversityBudapestHungary
  3. 3.Research Institute for Discrete MathematicsUniversity of BonnBonnGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-76796-1
  • Copyright Information Springer Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-540-76795-4
  • Online ISBN 978-3-540-76796-1
  • About this book