## Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 8th International Conference, CPAIOR 2011, Berlin, Germany, May 23-27, 2011. ProceedingsTobias Achterberg, J. Christopher Beck This book constitutes the refereed proceedings of the 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2011, held in Berlin, Germany, in May 2011. The 13 revised full papers and 7 revised short papers presented together with 3 invited lectures were carefully reviewed and selected from 35 submissions. The papers are focused on both theoretical and practical, application-oriented issues and present current research with a special focus on the integration and hybridization of the approaches of constraint programming, artificial intelligence, and operations research technologies for solving large scale and complex real life combinatorial optimization problems. |

### What people are saying - Write a review

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

### Contents

Preference Elicitation and Preference Learning in Social Choice | 1 |

How One Thing Leads to Another | 2 |

On Bilevel Programming and Its Impact in Branching Cutting and Complexity | 3 |

Optimization Methods for the Partner Units Problem | 4 |

Manipulating MDD Relaxations for Combinatorial Optimization | 20 |

The AllDifferent Constraint with Precedences | 36 |

Retail Store Workforce Scheduling by Expected Operating Income Maximization | 53 |

Spatial and Objective Decompositions for Very Large SCAPs | 59 |

Precedence Constraint Posting for Cyclic Scheduling Problems | 137 |

A Probing Algorithm for MINLP with Failure Prediction by SVM | 154 |

Recovering Indirect Solution Densities for CountingBased Branching Heuristics | 170 |

Using Hard Constraints for Representing Soft Constraints | 176 |

The Objective Sum Constraint | 190 |

Almost Square Packing | 196 |

Efficient Planning of Substation Automation System Cables | 210 |

A New Algorithm for Linear and Integer Feasibility in Horn Constraints | 215 |

Upgrading Shortest Paths in Networks | 76 |

A LagrangianBased Constraint Programming Approach | 92 |

BranchCutandPropagate for the Maximum kColorable Subgraph Problem with Symmetry | 99 |

Climbing DepthBounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks | 117 |

On Counting Lattice Points and ChvatalGomory Cutting Planes | 131 |

Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources | 230 |

Identifying Patterns in Sequences of Variables | 246 |

252 | |

### Other editions - View all

### Common terms and phrases

activities Aggressive Probing approach assignment bandwidth benchmark binary bounds consistency Branch-and-Bound CDADS color combinatorial combinatorial optimization computation conflict sets connections consider constraint programming cost CPAIOR CPLEX decomposition defined delay Discrepancy Search domain edge finding encodings esti feasible solution finite state machine graph coloring greedy algorithm Heidelberg heuristics Horn constraints hybrid implementation improve inequalities instances integer programming InterUnitCap interval J.C. Beck Eds k-colorable least element Lemma linear LNCS lower bound LP relaxation machine method minimize nodes NP-hard number of variables objective function optimal solution optimization problems packing problem performance precedence constraints propagation pruning rectangle relaxation repository resource s-probing iteration scheduling problem Section sensors set covering set covering problems shortest path Shortest Paths Problem soft constraints solver solving Springer straints sub-objective variables symmetry handling timetable UnitCap units update upgraded upper bound