Skip to main content
Springer Nature Link
Account

Integer Programming and Combinatorial Optimization

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

  • Conference proceedings
  • © 2002
Save conference proceedings
View saved research

Overview

Editors:
  1. William J. Cook

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

  2. Andreas S. Schulz

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

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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

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.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (33 papers)

  1. The Semidefinite Relaxation of the k-Partition Polytope Is Strong

    • Andreas Eisenblätter
    Pages 273-290

  2. A Polyhedral Study of the Cardinality Constrained Knapsack Problem

    • Ismael R. de Farias Jr., George L. Nemhauser
    Pages 291-303

  3. A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling

    • Mao-Cheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu
    Pages 304-314

  4. An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem

    • Alberto Caprara, Andrea Lodi, Michele Monaci
    Pages 315-328

  5. On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes

    • Klaus Jansen, Lorant Porkolab
    Pages 329-349

  6. Hard Equality Constrained Integer Knapsacks

    • Karen Aardal, Arjen K. Lenstra
    Pages 350-366

  7. The Distribution of Values in the Quadratic Assignment Problem

    • Alexander Barvinok, Tamon Stephen
    Pages 367-383

  8. A New Subadditive Approach to Integer Programming

    • Diego Klabjan
    Pages 384-400

  9. Improved Approximation Algorithms for Resource Allocation

    • Gruia Calinescu, Amit Chakrabarti, Howard Karloff, Yuval Rabani
    Pages 401-414

  10. Approximating the Advertisement Placement Problem

    • Freund Ari, Naor Joseph Seffi
    Pages 415-424

  11. Algorithms for Minimizing Response Time in Broadcast Scheduling

    • Rajiv Gandhi, Samir Khuller, Yoo-Ah Kim, Yung-Chun Justin Wan
    Pages 425-438

  12. Building Edge-Failure Resilient Networks

    • Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph (Seffi) Naor, Danny Raz
    Pages 439-456

  13. The Demand Matching Problem

    • Bruce Shepherd, Adrian Vetta
    Pages 457-474

  14. The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap

    • Kunal Talwar
    Pages 475-486

  15. Back Matter

    Pages 487-487
    Download chapter PDF
Back to top

Other volumes

  1. Integer Programming and Combinatorial Optimization

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

Accessibility information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic information

Keywords

Publish with us

Policies and ethics

Back to top