Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

5th International Conference, CPAIOR 2008 Paris, France, May 20-23, 2008 Proceedings

  • Editors
  • Laurent Perron
  • Michael A. Trick

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

Table of contents

  1. Front Matter
  2. Invited Talks

  3. Long Papers

    1. Tobias Achterberg, Timo Berthold, Thorsten Koch, Kati Wolter
      Pages 6-20
    2. Luca Benini, Michele Lombardi, Marco Mantovani, Michela Milano, Martino Ruggiero
      Pages 36-50
    3. Hadrien Cambazard, John Horan, Eoin O’Mahony, Barry O’Sullivan
      Pages 51-65
    4. Grégoire Dooms, Pascal Van Hentenryck
      Pages 66-81
    5. Lukas Kroc, Ashish Sabharwal, Bart Selman
      Pages 127-141
    6. Daniel H. Leventhal, Meinolf Sellmann
      Pages 142-157
    7. Christopher Mears, Maria Garcia de la Banda, Mark Wallace, Bart Demoen
      Pages 158-172
    8. Laurent Michel, Alexander Shvartsman, Eldine Sonderegger, Pascal Van Hentenryck
      Pages 188-202
    9. Gilles Pesant, Claude-Guy Quimper
      Pages 203-217
    10. Jakob Puchinger, Peter J. Stuckey, Mark Wallace, Sebastian Brand
      Pages 218-232

About these proceedings

Introduction

The 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008) was held in Paris, France May 20–23, 2008. The purpose of this conference series is to bring together researchers in the ?elds of constraint programming, arti?cial intelligence, and operations research to explore ways of solving large-scale, practical optimization problems through integration and hybridization of the ?elds’ di?erent techniques. Through the years, this research community is discovering that the ?elds have much in c- mon, and there has been tremendous richness in the resulting cross-fertilization of ?elds. This year, we allowed submissions of both long (15 page) and short (5 page) papers, with short papers either being original work, a reduced version of a long paper, or an extended abstract of work published elsewhere. We were not s- prised by the 69 submissions in the long paper category: this is an active ?eld with many researchers. We were surprised by the 61 short paper submissions. This was far more than predicted. With 130 high-quality submissions, compe- tion for acceptance in this year’s program was particularly ?erce. In the end, we accepted 18 long papers and 22 short papers for presentation and publication in this volume.

Keywords

AI Constraint Satisfaction Erfüllbarkeitsproblem der Aussagenlogik Operations Research algorithms artificial intelligence combinatorial optimization combinatorial optimization problems constraint programming cutting planes filtering heuristics high-performance computin optimization programming

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-68155-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-68154-0
  • Online ISBN 978-3-540-68155-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book