Skip to main content
  • Book
  • © 2003

Combinatorial Optimization -- Eureka, You Shrink!

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

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

Buy it now

Buying options

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

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

Table of contents (17 chapters)

  1. Front Matter

    Pages I-X
  2. “Eureka — You Skrink!”

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

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

      • Kathie Cameron
      Pages 34-38
    3. Hajós’ Construction and Polytopes

      • Reinhardt Euler
      Pages 39-47
    4. Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection

      • Robert T. Firla, Bianca Spille, Robert Weismantel
      Pages 48-63
    5. Solving Real-World ATSP Instances by Branch-and-Cut

      • Matteo Fischetti, Andrea Lodi, Paolo Toth
      Pages 64-77
    6. The One-Commodity Pickup-and-Delivery Travelling Salesman Problem

      • Hipólito Hernández-Pérez, Juan-José Salazar-González
      Pages 89-104
    7. An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming

      • Adam N. Letchford, Andrea Lodi
      Pages 119-133
    8. A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope

      • Jean François Maurras, Viet Hung Nguyen
      Pages 134-146
    9. Constructing New Facets of the Consecutive Ones Polytope

      • Marcus Oswald, Gerhard Reinelt
      Pages 147-157
    10. A Simplex-Based Algorithm for 0-1 Mixed Integer Programming

      • Jean-Philippe P. Richard, Ismael R. de Farias, George L. Nemhauser
      Pages 158-170
    11. Exact Algorithms for NP-Hard Problems: A Survey

      • Gerhard J. Woeginger
      Pages 185-207
  3. Back Matter

    Pages 209-209

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

Buy it now

Buying options

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