Skip to main content
SpringerLink
Log in

Research Trends in Combinatorial Optimization

Bonn 2008

  • Book
  • © 2009

Overview

Editors:
  1. William Cook

    1. Industrial and Systems Engineering, Georgia Tech, Atlanta, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. László Lovász

    1. Institute of Mathematics, Eötvös Loránd University, Budapest, Hungary

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Jens Vygen

    1. Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (23 chapters)

  1. Front Matter

    Pages i-xviii
    Download chapter PDF

  2. On the Location and p-Median Polytopes

    • Mourad Baïou, Francisco Barahona
    Pages 1-31

  3. Facet Generating Techniques

    • Sylvia Boyd, William R. Pulleyblank
    Pages 33-55

  4. Antimatroids, Betweenness, Convexity

    • Vašek Chvátal
    Pages 57-64

  5. Euler Complexes

    • Jack Edmonds
    Pages 65-68

  6. Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid

    • Jean Fonlupt, Alexandre Skoda
    Pages 69-85

  7. A Survey on Covering Supermodular Functions

    • András Frank, Tamás Király
    Pages 87-126

  8. Theory of Principal Partitions Revisited

    • Satoru Fujishige
    Pages 127-162

  9. Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach

    • Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
    Pages 163-183

  10. Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

    • Stefan Hougardy
    Pages 185-200

  11. The Unbounded Knapsack Problem

    • T. C. Hu, Leo Landa, Man-Tak Shing
    Pages 201-217

  12. Recent Developments in Discrete Convex Analysis

    • Kazuo Murota
    Pages 219-260

  13. Multiflow Feasibility: An Annotated Tableau

    • Guyslain Naves, András Sebő
    Pages 261-283

  14. Many Facets of Dualities

    • Jaroslav Nešetřil
    Pages 285-302

  15. On the Structure of Graphs Vertex Critical with Respect to Connected Domination

    • Michael D. Plummer
    Pages 303-315

  16. LS-LIB: A Library of Tools for Solving Production Planning Problems

    • Yves Pochet, Mathieu Van Vyve, Laurence A. Wolsey
    Pages 317-346

  17. From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis

    • Lionel Pournin, Thomas M. Liebling
    Pages 347-363

  18. Graphic Submodular Function Minimization: A Graphic Approach and Applications

    • Myriam Preissmann, András Sebő
    Pages 365-385

  19. Matroids—the Engineers’ Revenge

    • András Recski
    Pages 387-398

  20. On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming

    • Andreas S. Schulz
    Pages 399-428
Back to top

Keywords

About this book

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.

Reviews

Aus den Rezensionen: “Das Gebiet der kombinatorischen Optimierung umfasst ein weites Spektrum von verschiedenen mathematischen Problemen und Methoden, und ist sowohl aus praktischer als auch aus theoretischer Sicht interessant. Der praktische Nutzen ist offensichtlich, denn in fast jedem Bereich, der mathematische Methoden zur Analyse oder zur Optimierung verwendet ... treten an prominenter Stelle anspruchsvolle kombinatorische Optimierungsprobleme auf. Ein innermathematisch reizvoller Aspekt wird im Vorwort des rezensierten Buches schön beschrieben ... Insgesamt kann man konstatieren, daß das Buch unbedingt zu empfehlen ist für alle ...“ (Thomas Kalinowski, in: RHO Mathematik Verein www.math.uni-rostock.de/rho, September/2009)

Editors and Affiliations

  • Industrial and Systems Engineering, Georgia Tech, Atlanta, USA

    William Cook

  • Institute of Mathematics, Eötvös Loránd University, Budapest, Hungary

    László Lovász

  • Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany

    Jens Vygen

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation