Integer Programming and Combinatorial Optimization

9th International IPCO Conference Cambridge, MA, USA, May 27–29, 2002 Proceedings

  • William J. Cook
  • Andreas S. Schulz
Conference proceedings IPCO 2002

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

Table of contents

  1. Front Matter
    Pages I-XI
  2. Lisa Fleischer, Martin Skutella
    Pages 36-53
  3. Michael Lewin, Dror Livnat, Uri Zwick
    Pages 67-82
  4. Adam N. Letchford, Andrea Lodi
    Pages 93-108
  5. Kent Andersen, Gérard Cornuéjols, Yanjun Li
    Pages 127-144
  6. Jean-Philippe P. Richard, Ismael R. de Farias Jr, George L. Nemhauser
    Pages 161-175
  7. Ron Aharoni, Tamás Fleiner
    Pages 176-187
  8. Jay Sethuraman, Chung-Piaw Teo, Rakesh V. Vohra
    Pages 194-211
  9. Ernst Althaus, Christian Fink
    Pages 258-272

About these proceedings

Introduction

This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27–29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the ?rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical Programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti?c program of IPCO 2002. The selection was based on originality and quality, and re?ects many of the current directions in integer programming and combinatorial optimization research.

Keywords

Approximation Combinatorics Computational Complexity Computational Geometry Graph Algorithms Integer Programming Mathematical Programming Network Algorithms Scheduling algorithms combinatorial optimization optimization programming

Editors and affiliations

  • William J. Cook
    • 1
  • Andreas S. Schulz
    • 2
  1. 1.Program in Applied and Computational MathematicsUniversity of PrincetonPrincetonUSA
  2. 2.Sloan School of ManagementMassachusetts Institute of TechnologyCambridgeUSA

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-47867-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-43676-8
  • Online ISBN 978-3-540-47867-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book