| Article ID: | iaor20084038 |
| Country: | Netherlands |
| Volume: | 173 |
| Issue: | 2 |
| Start Page Number: | 519 |
| End Page Number: | 530 |
| Publication Date: | Sep 2006 |
| Journal: | European Journal of Operational Research |
| Authors: | Appa Gautam, Magos D., Mourtos I. |
| Keywords: | programming: integer |
This paper applies algorithms integrating Integer Programming (IP) and Constraint Programming (CP) to the Mutually Orthogonal Latin Squares (MOLS) problem. We investigate the behaviour of these algorithms against traditional IP and CP schemes. Computational results are obtained with respect to various aspects of the algorithms, using instances of the 2 MOLS and 3 MOLS problems. The benefits of integrating IP with CP on this feasibility problem are clearly exhibited, especially in large problem instances.