We consider the problem of Mutually Orthogonal Latin Squares and propose two algorithms which integrate Integer Programming (IP) and Constraint Programming (CP). Their behaviour is examined and compared to traditional CP and IP algorithms. The results assess the quality of inference achieved by the CP and IP, mainly in terms of early identification of infeasible subproblems. It is clearly illustrated that the integration of CP and IP is beneficial and that one hybrid algorithm exhibits the best performance as the problem size grows. An approach for reducing the search by excluding isomorphic cases is also presented.
CITATION STYLE
Appa, G., Mourtos, I., & Magos, D. (2002). Integrating constraint and integer programming for the orthogonal latin squares problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2470, pp. 17–32). Springer Verlag. https://doi.org/10.1007/3-540-46135-3_2
Mendeley helps you to discover research relevant for your work.