Redundant Modeling for the QuasiGroup Completion Problem
The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint programming.  reports that QCPs of order 40 could not be solved by pure constraint programming approaches, but could sometimes be solved by hybrid approaches combining constraint programming with mixed integer programming techniques from operations research. In this paper, we show that the pure constraint satisfaction approach can solve many problems of order 45 in the transition phase, which corresponds to the peak of difficulty. Our solution combines a number of known ideas –the use of redundant modeling  with primal and dual models of the problem connected by channeling constraints  – with some novel aspects, as well as a new and very effective value ordering heuristic.
KeywordsDual Variable Constraint Satisfaction Problem Dual Model Redundant Constraint Dual Constraint
Unable to display preview. Download preview PDF.
- 1.Bessiere, C., Regin, J.C.: Mac and combined heuristics: two reason to forsake FC (and CBJ?) on hard problems. In: 2nd Int. Conf. on Principles and Practice of Constraint Programming pp. 61–75 (1996)Google Scholar
- 2.Bitner, J., Reingold, E.M.: Backtrack programming techniques. Communications of the ACM 18, 651–655Google Scholar
- 3.Cheng, B.M.W., Lee, J.H.M., Wu, J.C.K.: Speeding up constraint propagation by redundant modeling. In: 2nd Int. Conf. on Principles and Practice of Constraint Programming, pp. 91–103 (1996)Google Scholar
- 4.Colbourn, C.: The complexity of completing partial latin squares. Discrete applied MathematicsGoogle Scholar
- 5.Gomes, C., Shmoys, D.B.: The promise of LP to Boost CSP Techniques for Combinatorial Problems. In: CP-AI-OR 2002, pp. 291–305 (2002)Google Scholar
- 6.Gomes, C., Shmoys, D.B.: Completing Quasigroups or Latin Squares: A Structured Graph Coloring Proble. In: Proc. Computational Symposium on Graph Coloring and Extensions (2002)Google Scholar
- 8.Regin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proc. AAAI 1994, pp. 362–367 (1994)Google Scholar
- 9.Sergiou, K., Walsh, T.: The difference all-difference makes. In: Proc. IJCAI 1999 (1999)Google Scholar
- 11.Barbara, M.S.: Modeling a Permutation Problem. In: Proceedings of ECAI 2000 Workshop on Modeling and Solving Problems with Constraints (2000)Google Scholar
- 12.van Beek, P., Chen, X.: CPlan: A Constraint Programming Approach to Planning. In: AAAI 1999, pp. 585–590 (1999)Google Scholar
- 14.Smith, B.M.: Dual Models in Constraint Programming. School Computing Research Report 2001.02, University of Leeds (January 2001)Google Scholar
- 15.Cheng, B.M.W., et al.: Increasing Constraint Propagation by Redundant Modeling: an Experience Report. In: Constraints, pp. 167–192. Kluwer Academic Publishers, Dordrecht (1999)Google Scholar