A systematic approach to MDD-based constraint programming
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Upper bounds on the number of solutions of binary integer programs
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
Inference in constraint programming is usually based on the deductions generated by individual constraints which are then communicated to other constraints through domain filtering. Frequently we find that this is a too coarse-grained form of communication since constraints could exchange more powerful forms of deductions that could help reduce the search effort. In this paper we propose a particular technique for enhancing inference in constraint programming, by generating deductions that involve tighter interleaving of constraints. We apply our method to the Market Split Problem and obtain massive speed-ups whichbrings a new order of Market Split Problems into the realm of solvability by means of constraint programming.