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

1. Long Papers

   1. Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic

      • Tino Teige, Martin Fränzle

      Pages 248-262

   2. A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem

      • Jean-Paul Watson, J. Christopher Beck

      Pages 263-277

2. Short Papers

   1. Counting Solutions of Integer Programs Using Unrestricted Subtree Detection

      • Tobias Achterberg, Stefan Heinz, Thorsten Koch

      Pages 278-282

   2. Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts

      • Doug Altner, Özlem Ergun

      Pages 283-287

   3. A Hybrid Approach for Solving Shift-Selection and Task-Sequencing Problems

      • Ada Barlatt, Amy M. Cohn, Oleg Gusikhin

      Pages 288-292

   4. Solving a Log-Truck Scheduling Problem with Constraint Programming

      • Nizar El Hachemi, Michel Gendreau, Louis-Martin Rousseau

      Pages 293-297

   5. Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints

      • Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant

      Pages 298-302

   6. Connections in Networks: A Hybrid Approach

      • Carla P. Gomes, Willem-Jan van Hoeve, Ashish Sabharwal

      Pages 303-307

   7. Efficient Haplotype Inference with Combined CP and OR Techniques

      • Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira

      Pages 308-312

   8. Integration of CP and Compilation Techniques for Instruction Sequence Test Generation

      • Boris Gutkovich

      Pages 313-317

   9. Propagating Separable Equalities in an MDD Store

      • T. Hadzic, J. N. Hooker, P. Tiedemann

      Pages 318-322

   10. The Weighted Cfg Constraint

       • George Katsirelos, Nina Narodytska, Toby Walsh

       Pages 323-327

   11. CP with ACO

       • Madjid Khichane, Patrick Albert, Christine Solnon

       Pages 328-332

   12. A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract)

       • Hoong Chuin Lau, Kong Wei Lye, Viet Bang Nguyen

       Pages 333-337

   13. Constraint Optimization and Abstraction for Embedded Intelligent Systems

       • Paul Maier, Martin Sachenbacher

       Pages 338-342

   14. A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs

       • Mahdi Namazifar, Andrew J. Miller

       Pages 343-348

   15. Guiding Stochastic Search by Dynamic Learning of the Problem Topography

       • Yehuda Naveh

       Pages 349-354

   16. Hybrid Variants for Iterative Flattening Search

       • Angelo Oddi, Amedeo Cesta, Nicola Policella, Stephen F. Smith

       Pages 355-360

   17. Global Propagation of Practicability Constraints

       • Thierry Petit, Emmanuel Poder

       Pages 361-366

   18. The Polytope of Tree-Structured Binary Constraint Satisfaction Problems

       • Meinolf Sellmann

       Pages 367-371

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.

• 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

Policies and ethics