## Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 ProceedingsThe6thInternationalConferenceontheIntegrationofAIandORTechniquesin Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2009) was held in Pittsburgh, USA, May 29-31, 2009. More information about the CPAIOR conference series can be found atwww.cpaior.org. This volume contains the papers and extended abstracts that were presented during the c- ference. In total there were 65 high-quality submissions, including 41 full paper and 24 extended abstract submissions. The full papers re?ect original unpublished work, whereas the extended abstracts can be either original unpublished work or a summary of work published elsewhere. Each full paper was reviewed by at least three Program Committee members, and most extended abstracts by two. After generaldiscussion, the ProgramCommitteeaccepted 20full papersand 10 extendedabstractsforpresentationduringtheconferenceandpublicationinthis volume. The submissions, reviews, discussion, and the proceedings preparation were all handled by the EasyChair system. We thank the Program Committee, as well as the external reviewers, for their hard work. Inadditiontothefullpaperandextendedabstractpresentation, theprogram contained two invited talks, by Eva K. Lee (Georgia Institute of Technology) and Mark Wallace (Monash University). A summary of each invited talk is also included in this volume. Atwo-daytutorialonconstraintprogrammingwasheldbeforetheconference, during May 27-28, 2009. There were four parts to the tutorial: "Introduction to CP Concepts" presented by Peter van Beek, "Modeling in CP" presented by Helmut Simonis, "Combining CP and Operations Research" presented by John Hooker, and "CP Languages, Systems, and Examples" presented by Laurent Michel, Pascal Van Hentenryck, and Paul Shaw. We thank all tutorial speakers for their e?orts. We also thank the tutorial chair Gilles Pesant for his help in organizing this event. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Machine Learning Framework for Classiﬁcation in Medicine and Biology | 1 |

G12 Towards the Separation of Problem Modelling and Problem Solving | 8 |

Six Ways of Integrating Symmetries within Nonoverlapping Constraints | 11 |

Throughput Constraint for Synchronous Data Flow Graphs | 26 |

A Shortest PathBased Approach to the Multileaf Collimator Sequencing Problem | 41 |

Feasibility and Optimality | 56 |

Solution Enumeration for Projected Boolean Search Problems | 71 |

kClustering Minimum Biclique Completion via a Hybrid CP and SDP Approach | 87 |

Determining the Number of Games Needed to Guarantee an NHL Playoff Spot | 233 |

Scalable Load Balancing in Nurse to Patient Assignment Problems | 248 |

Learning How to Propagate Using Random Probing | 263 |

DFS and the Traveling Tournament Problem | 279 |

Max Energy Filtering Algorithm for Discrete Cumulative Resources | 294 |

Hybrid Branching | 309 |

A Comparative Analysis of Models Solution Methods and Their Integration | 312 |

Constraint Models for Sequential Planning | 314 |

Optimal Interdiction of Unreactive Markovian Evaders | 102 |

Using Model Counting to Find Optimal Distinguishing Tests | 117 |

Reformulating Global Grammar Constraints | 132 |

IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems | 148 |

Open Constraints in a Boundable World | 163 |

Sequencing and Counting with the multicostregular Constraint | 178 |

BandwidthLimited Optimal Deployment of EventuallySerializable Data Services | 193 |

Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming | 208 |

The Polytope of ContextFree Grammar Constraints | 223 |

A Fast Algorithm to Solve the Frequency Assignment Problem | 316 |

A Hybrid LSCP Approach to Solve the Weekly LogTruck Scheduling Problem | 319 |

Modelling Search Strategies in Rules2CP | 321 |

Embedding ConstraintBased Decision Engines in Business Applications | 323 |

An Integrated Genetic Algorithm and Integer Programming Approach to the Network Design Problem with Relays | 325 |

A Benders Approach to a Transportation Network Design Problem | 326 |

Progress on the Progressive Party Problem | 328 |

Author Index | 330 |

### Other editions - View all

### Common terms and phrases

approach assignment automaton benchmarks Berlin Heidelberg 2009 biclique bipartite graph cluster computed conﬂict consistency Constraint Programming constraint satisfaction problem context-free grammar corresponding cost CP model CPAIOR CPLEX decision decomposition deﬁned Deﬁnition denote diﬀerent domain edges eﬃcient Envv evader feasible ﬁltering ﬁnal ﬁnd ﬁnding ﬁnite ﬁrst ﬁxed ﬂow given global constraints GRAMMAR constraint graph greedy algorithm Heidelberg heuristic Hoeve and J.N. ILOG implementation instances integer partitions interdiction iteration J.N. Hooker Eds language lex-chain lexicographic ordering Line linear LNCS lower bound LP relaxation matrix maximum minimize node nogoods non-overlapping NP-hard nurses optimal solution optimality backdoors optimization problems OR-NODE orthotopes partition playoﬀ projective solutions propagation quasi-biclique satisﬁability scheduling SDFG sequence shortest path shortest path problem signiﬁcantly solved solver speciﬁc Springer Springer-Verlag Berlin Heidelberg stack straint sub-solver subproblem subset task teams throughput tion tuple upper bound