Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem

Authors:
Gautam Appa;Ioannis Mourtos;Dimitris Magos
Affiliations:
-;-;-
Venue:
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Year:
2002

Citing 6
Cited 2

Integer and combinatorial optimization

Integer and combinatorial optimization
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Mixed logical-linear programming

Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Introduction to DIMACS workshop on constraint programming and large scale discrete optimization

DIMACS workshop on on Constraint programming and large scale discrete optimization
Logic-Based Methods for Optimization

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Branch and Infer: a Unifying Framework for Integer and Finite Domain Constraint Programming

INFORMS Journal on Computing

An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6

Operations Research Letters
Balancing and scheduling of flexible mixed model assembly lines

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.