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.
Author(s): Cynthia Barnhart (auth.), Laurent Perron, Michael A. Trick (eds.)
Series: Lecture Notes in Computer Science 5015
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2008
Language: English
Pages: 394
Tags: Numeric Computing; Discrete Mathematics in Computer Science; Algorithm Analysis and Problem Complexity; Artificial Intelligence (incl. Robotics); Operations Research/Decision Theory; Combinatorics
Front Matter....Pages -
Airline Scheduling: Accomplishments, Opportunities and Challenges....Pages 1-1
Selected Challenges from Distribution and Commerce in the Airline and Travel Industry....Pages 2-4
30 Years of Constraint Programming....Pages 5-5
Constraint Integer Programming: A New Approach to Integrate CP and MIP....Pages 6-20
New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles....Pages 21-35
Multi-stage Benders Decomposition for Optimizing Multicore Architectures....Pages 36-50
Fast and Scalable Domino Portrait Generation....Pages 51-65
Gap Reduction Techniques for Online Stochastic Project Scheduling....Pages 66-81
Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver....Pages 82-96
Cost Propagation – Numerical Propagation for Optimization Problems....Pages 97-111
Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs....Pages 112-126
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting....Pages 127-141
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems....Pages 142-157
A Novel Approach For Detecting Symmetries in CSP Models....Pages 158-172
Amsaa : A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization....Pages 173-187
Optimal Deployment of Eventually-Serializable Data Services....Pages 188-202
Counting Solutions of Knapsack Constraints....Pages 203-217
From High-Level Model to Branch-and-Price Solution in G12....Pages 218-232
Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint....Pages 233-247
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic....Pages 248-262
A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem....Pages 263-277
Counting Solutions of Integer Programs Using Unrestricted Subtree Detection....Pages 278-282
Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts....Pages 283-287
A Hybrid Approach for Solving Shift-Selection and Task-Sequencing Problems....Pages 288-292
Solving a Log-Truck Scheduling Problem with Constraint Programming....Pages 293-297
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints....Pages 298-302
Connections in Networks: A Hybrid Approach....Pages 303-307
Efficient Haplotype Inference with Combined CP and OR Techniques....Pages 308-312
Integration of CP and Compilation Techniques for Instruction Sequence Test Generation....Pages 313-317
Propagating Separable Equalities in an MDD Store....Pages 318-322
The Weighted Cfg Constraint....Pages 323-327
CP with ACO....Pages 328-332
A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract)....Pages 333-337
Constraint Optimization and Abstraction for Embedded Intelligent Systems....Pages 338-342
A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs....Pages 343-348
Guiding Stochastic Search by Dynamic Learning of the Problem Topography....Pages 349-354
Hybrid Variants for Iterative Flattening Search....Pages 355-360
Global Propagation of Practicability Constraints....Pages 361-366
The Polytope of Tree-Structured Binary Constraint Satisfaction Problems....Pages 367-371
A Tabu Search Method for Interval Constraints....Pages 372-376
The Steel Mill Slab Design Problem Revisited....Pages 377-381
Filtering Atmost1 on Pairs of Set Variables....Pages 382-386
Mobility Allowance Shuttle Transit (MAST) Services: MIP Formulation and Strengthening with Logic Constraints....Pages 387-391
Back Matter....Pages -
