Integer Programming and Combinatorial Optimization

8th International IPCO Conference Utrecht, The Netherlands, June 13–15, 2001 Proceedings

  • Karen Aardal
  • Bert Gerards

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

Table of contents

  1. Front Matter
    Pages I-XI
  2. Joseph Cheriyan, Santosh Vempala
    Pages 30-44
  3. Fabián A. Chudak, Tim Roughgarden, David P. Williamson
    Pages 60-70
  4. Gérard Cornuéjols, Yanjun Li
    Pages 71-77
  5. Friedrich Eisenbrand, Günter Rote
    Pages 78-89
  6. Michael Elkin, David Peleg
    Pages 90-104
  7. András Frank, Tamás Király
    Pages 130-144
  8. András Frank, László Szegő
    Pages 145-159
  9. Satoru Fujishige, Satoru Iwata
    Pages 160-169
  10. Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. S. Salman, Amitabh Sinha
    Pages 170-184
  11. Bertrand Guenin
    Pages 185-195
  12. Refael Hassin, Asaf Levin
    Pages 226-235
  13. A. Hordijk, D. A. van der Laan
    Pages 236-250

About these proceedings

Introduction

This volume contains the papers selected for presentation at IPCO VIII, the Eighth Conference on Integer Programming and Combinatorial Optimization, Utrecht, The Netherlands, 2001. This meeting isa forum for researchers and practitioners working on various aspects of integer programming and combi- torial optimization. The aim is to present recent developments in theory, com- tation, and application of integer programming and combinatorial optimization. Topics include, but are not limited to: approximation algorithms, branch and bound algorithms, computational biology, computational complexity, compu- tional geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms, polyhedral combinatorics, scheduling theory and algorithms, and semide nit e programs. IPCO was established in 1988 when the rs t IPCO program committee was formed. The locations and years of the seven rs t IPCO conferences were: IPCO I, Waterloo (Canada) 1990, IPCO II, Pittsburgh (USA) 1992, IPCO III, - ice (Italy) 1993, IPCO IV, Copenhagen (Denmark) 1995, IPCO V, Vancouver (Canada) 1996, IPCO VI, Houston (USA) 1998, IPCO VII, Graz (Austria) 1999. IPCO is held every year in which no MPS (Mathematical Programming Society) International Symposium takes place. Since the MPS meeting is triennial, IPCO conferences are held twice in every three-year period. Asa rule, IPCO is held somewhere in Northern America in even years, and somewhere in Europe in odd years.

Keywords

Approximation Approximation Algorithms Computational Complexity Discrete Mathematics Graph Algorithms Integer Programming Mathematical Programming Network Algorithms Scheduling Computational Geometry Variable algorithms combinatorial optimization complexity optimization programming

Editors and affiliations

  • Karen Aardal
    • 1
  • Bert Gerards
    • 2
  1. 1.Instituut voor Informatica en InformatiekundeUniversiteit UtrechtCH UtrechtThe Netherlands
  2. 2.CWISJ AmsterdamThe Netherlands

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45535-3
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42225-9
  • Online ISBN 978-3-540-45535-6
  • Series Print ISSN 0302-9743
  • About this book
Industry Sectors
Pharma
Biotechnology
Telecommunications
Consumer Packaged Goods
Aerospace
Oil, Gas & Geosciences