Skip to main content
SpringerLink
Log in

Integer Programming and Combinatorial Optimization

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

  • Conference proceedings
  • © 2002

Overview

Editors:
  1. William J. Cook

    1. Program in Applied and Computational Mathematics, University of Princeton, Princeton, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Andreas S. Schulz

    1. Sloan School of Management, Massachusetts Institute of Technology, Cambridge, USA

    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 2337)

Included in the following conference series:

Conference proceedings info: IPCO 2002.

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 (33 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. A Faster Scaling Algorithm for Minimizing Submodular Functions

    • Satoru Iwata
    Pages 1-8

  3. A Generalization of Edmonds’ Matching and Matroid Intersection Algorithms

    • Bianca Spille, Robert Weismantel
    Pages 9-20

  4. A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization

    • Akihisa Tamura
    Pages 21-35

  5. The Quickest Multicommodity Flow Problem

    • Lisa Fleischer, Martin Skutella
    Pages 36-53

  6. A New Min-Cut Max-Flow Ratio for Multicommodity Flows

    • Oktay Günlük
    Pages 54-66

  7. Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems

    • Michael Lewin, Dror Livnat, Uri Zwick
    Pages 67-82

  8. Finding the Exact Integrality Gap for Small Traveling Salesman Problems

    • Sylvia Boyd, Geneviève Labonté
    Pages 83-92

  9. Polynomial-Time Separation of Simple Comb Inequalities

    • Adam N. Letchford, Andrea Lodi
    Pages 93-108

  10. A New Approach to Cactus Construction Applied to TSP Support Graphs

    • Klaus M. Wenger
    Pages 109-126

  11. Split Closure and Intersection Cuts

    • Kent Andersen, Gérard Cornuéjols, Yanjun Li
    Pages 127-144

  12. An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs

    • Sanjeeb Dash
    Pages 145-160

  13. Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms

    • Jean-Philippe P. Richard, Ismael R. de Farias Jr, George L. Nemhauser
    Pages 161-175

  14. On a Lemma of Scarf

    • Ron Aharoni, Tamás Fleiner
    Pages 176-187

  15. A Short Proof of Seymour’s Characterization of the Matroids with the Max-Flow Min-Cut Property

    • Bertrand Guenin
    Pages 188-193

  16. Integer Programming and Arrovian Social Welfare Functions

    • Jay Sethuraman, Chung-Piaw Teo, Rakesh V. Vohra
    Pages 194-211

  17. Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design

    • Ramamoorthi Ravi, Amitabh Sinha
    Pages 212-229

  18. The Minimum Latency Problem Is NP-Hard for Weighted Trees

    • René Sitters
    Pages 230-239

  19. An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

    • Maxim Sviridenko
    Pages 240-257

  20. A Polyhedral Approach to Surface Reconstruction from Planar Contours

    • Ernst Althaus, Christian Fink
    Pages 258-272
Back to top

Other volumes

  1. Integer Programming and Combinatorial Optimization

Keywords

About this book

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.

Editors and Affiliations

  • Program in Applied and Computational Mathematics, University of Princeton, Princeton, USA

    William J. Cook

  • Sloan School of Management, Massachusetts Institute of Technology, Cambridge, USA

    Andreas S. Schulz

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation