Skip to main content
  • Conference proceedings
  • © 2008

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

Conference proceedings info: CPAIOR 2008.

Buying options

eBook USD 89.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-68155-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 119.00
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (43 papers)

  1. Front Matter

  2. Long Papers

    1. Constraint Integer Programming: A New Approach to Integrate CP and MIP

      • Tobias Achterberg, Timo Berthold, Thorsten Koch, Kati Wolter
      Pages 6-20
    2. Multi-stage Benders Decomposition for Optimizing Multicore Architectures

      • Luca Benini, Michele Lombardi, Marco Mantovani, Michela Milano, Martino Ruggiero
      Pages 36-50
    3. Fast and Scalable Domino Portrait Generation

      • Hadrien Cambazard, John Horan, Eoin O’Mahony, Barry O’Sullivan
      Pages 51-65
    4. Gap Reduction Techniques for Online Stochastic Project Scheduling

      • Grégoire Dooms, Pascal Van Hentenryck
      Pages 66-81
    5. Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting

      • Lukas Kroc, Ashish Sabharwal, Bart Selman
      Pages 127-141
    6. The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems

      • Daniel H. Leventhal, Meinolf Sellmann
      Pages 142-157
    7. A Novel Approach For Detecting Symmetries in CSP Models

      • Christopher Mears, Maria Garcia de la Banda, Mark Wallace, Bart Demoen
      Pages 158-172
    8. Optimal Deployment of Eventually-Serializable Data Services

      • Laurent Michel, Alexander Shvartsman, Eldine Sonderegger, Pascal Van Hentenryck
      Pages 188-202
    9. Counting Solutions of Knapsack Constraints

      • Gilles Pesant, Claude-Guy Quimper
      Pages 203-217
    10. From High-Level Model to Branch-and-Price Solution in G12

      • Jakob Puchinger, Peter J. Stuckey, Mark Wallace, Sebastian Brand
      Pages 218-232

Other Volumes

  1. 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

About this book

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
  • algorithm analysis and problem complexity

Bibliographic Information

Buying options

eBook USD 89.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-68155-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 119.00
Price excludes VAT (USA)