Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Combinatorial Optimization -- Eureka, You Shrink!

Papers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers

  • Book
  • © 2003

Overview

Editors:
  1. Michael Jünger

    1. Institut für Informatik, Universität zu Köln, Köln, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gerhard Reinelt

    1. Institut für Informatik, Universität Heidelberg, Heidelberg, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Giovanni Rinaldi

    1. Istituto di Analisi dei Sistemi ed Informatica “Antonio Ruberti”, CNR, Rome, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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 (17 chapters)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. “Eureka — You Skrink!”

    1. “Eureka — You Shrink!”

      Pages 1-10

    2. Submodular Functions, Matroids, and Certain Polyhedra

      • Jack Edmonds
      Pages 11-26

    3. Matching: A Well-Solved Class of Integer Linear Programs

      • Jack Edmonds, Ellis L. Johnson
      Pages 27-30

    4. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

      • Jack Edmonds, Richard M. Karp
      Pages 31-33

    5. Connected Matchings

      • Kathie Cameron
      Pages 34-38

    6. Hajós’ Construction and Polytopes

      • Reinhardt Euler
      Pages 39-47

    7. Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection

      • Robert T. Firla, Bianca Spille, Robert Weismantel
      Pages 48-63

    8. Solving Real-World ATSP Instances by Branch-and-Cut

      • Matteo Fischetti, Andrea Lodi, Paolo Toth
      Pages 64-77

    9. The Bundle Method for Hard Combinatorial Optimization Problems

      • Gerald Gruber, Franz Rendl
      Pages 78-88

    10. The One-Commodity Pickup-and-Delivery Travelling Salesman Problem

      • Hipólito Hernández-Pérez, Juan-José Salazar-González
      Pages 89-104

    11. Reconstructing a Simple Polytope from Its Graph

      • Volker Kaibel
      Pages 105-118

    12. An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming

      • Adam N. Letchford, Andrea Lodi
      Pages 119-133

    13. A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope

      • Jean François Maurras, Viet Hung Nguyen
      Pages 134-146

    14. Constructing New Facets of the Consecutive Ones Polytope

      • Marcus Oswald, Gerhard Reinelt
      Pages 147-157

    15. A Simplex-Based Algorithm for 0-1 Mixed Integer Programming

      • Jean-Philippe P. Richard, Ismael R. de Farias, George L. Nemhauser
      Pages 158-170

    16. Mixed-Integer Value Functions in Stochastic Programming

      • Rüdiger Schultz
      Pages 171-184

    17. Exact Algorithms for NP-Hard Problems: A Survey

      • Gerhard J. Woeginger
      Pages 185-207

  3. Back Matter

    Pages 209-209
    Download chapter PDF
Back to top

Keywords

Editors and Affiliations

  • Institut für Informatik, Universität zu Köln, Köln, Germany

    Michael Jünger

  • Institut für Informatik, Universität Heidelberg, Heidelberg, Germany

    Gerhard Reinelt

  • Istituto di Analisi dei Sistemi ed Informatica “Antonio Ruberti”, CNR, Rome, Italy

    Giovanni Rinaldi

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation