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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Appa G., Magos D., Mourtos I., Janssen J. C. M.: On the Orthogonal Latin Squares polytope. Submitted to Discrete Mathematics (2001). (URL: http://www.cdam.lse.ac.uk/Reports/reports2001.html)
Bockmayr A., Casper T.: Branch and infer: a unifying framework for integer and finite domain constraint programming. INFORMS Journal on Computing, 10 (1998) 187–200.
Chandru V., Hooker J. N.: Optimization methods for logical inference. J.Wiley (1999).
Dantzig G. B.: Linear Programming and extensions. Princeton Univ. Press (1963).
Dénes J., Keedwell A. D.: Latin squares and their applications. Acad. Press (1974).
Freuder E. C., Wallace R. J. (ed.): Constraint Programming and Large Scale Discrete Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 57, Amer. Math. Soc (1998).
Gomes C., Shmoys D.: The Promise of LP to Boost CSP Techniques for Combinatorial Problems, CP-AI-OR’02, 291-305, Le Croisic, France (2002).
Hooker J. N., Osorio M. A.: Mixed logical/linear programming. Discrete Applied Mathematics, 9697 (1994) 395–442.
Hooker J. N.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. J.Wiley (2000).
Laywine C. F., Mullen G. L.: Discrete Mathematics using Latin squares. J.Wiley (1998).
Magos D., Miliotis P.: An algorithm for the planar three-index assignment problem. European Journal of Operational Research 77 (1994) 141–153.
Nemhauser G. L., Wolsey L. A.: Integer and Combinatorial Optimization. J.Wiley (1988).
Regin J. C.: A filtering algorithm for constraints of difference in CSPs. Proceedings of National Conference on Artificial Intelligence (1994), 362–367.
Savelsbergh M. W. P.: Preprocessing and Probing for Mixed Integer Programming Problems. ORSA J. on Computing, 6 (1994) 445–454.
Tsang E.: Foundations of Constraint Satisfaction, Acad. Press (1993).
Dash Associates: XPRESS-MP Version 12, Reference Manual (2001).
Zhang H., Hsiang J.: Solving open quasigroup problems by propositional reasoning, Proc. of International Computer Symposium, Hsinchu, Taiwan (1994).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Appa, G., Mourtos, I., Magos, D. (2002). Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_2
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive