Searching for Mutually Orthogonal Latin Squares via integer and constraint programming

European Journal of Operational Research

Volumn 173, Issue 2, 2006, Pages 519-530

  Appa, G ^a   Magos, D ^b   Mourtos, I ^a  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^b UNIVERSITY OF WEST ATTICA   (Greece)

Author keywords

Constraints satisfaction; Integer programming; Mutually Orthogonal Latin Squares

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; INTEGER PROGRAMMING; MATHEMATICAL PROGRAMMING; OPERATIONS RESEARCH;

COMPUTATIONAL RESULTS; CONSTRAINT PROGRAMMING; CONSTRAINTS SATISFACTION; MUTUALLY ORTHOGONAL LATIN SQUARES PROBLEMS;

CONSTRAINT THEORY;

EID: 33646521516     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.01.048     Document Type: Article

References (30)

1. Appa, G., Magos, D., Mourtos, I., Janssen, J.C.M., 2001. Clique facets of the orthogonal Latin squares polytope, CDAM Research Reports Series, LSE-CDAM-2001-04, London School of Economics. Available from: .
2. Appa, G., Magos, D., Mourtos, I., 2002a. Polyhedral results for assignment problems, CDAM Research Reports Series, LSE-CDAM-2002-01, London School of Economics. Available from: .
3. Appa G., Mourtos I., and Magos D. Integrating constraint and integer programming for the OLS problem. In: Van Hentenryck P. (Ed). Proceedings of CP2002. LNCS 2470 (2002), Springer 17-32
4. Appa G., Magos D., and Mourtos I. A Branch & Cut algorithm for the planar four-index assignment problem. Journal of the Operational Research Society 55 3 (2004) 298-307
5. Beale E.M.L., and Forrest J.J.H. Global optimization using special ordered sets. Mathematical Programming 10 1 (1976) 52-69
6. Bockmayr A., and Kasper T. Branch and infer: A unifying framework for integer and finite domain constraint programming. INFORMS Journal on Computing 10 (1998) 187-200
7. Bockmayr, A., Pisaruk, N., 2003. Detecting infeasibility and generating cuts for MIP using CP. In: Proceedings of CP-AI-OR'03, Montreal, Canada.
8. Chandru V., and Hooker J.N. Optimization Methods for Logical Inference (1999), John Wiley, New York
9. Colbourn C.J., and Dinitz J.H. Mutually orthogonal Latin squares: A brief survey of constructions. Journal of Statistical Planning and Inference 95 (2001) 9-48
10. Dantzig G.B. Linear Programming and Extensions (1973), Princeton University Press, NJ
11. Dash Associates, 2001. XPRESS-MP Version 12, Reference Manual.
12. Dénes J., and Keedwell A.D. Latin Squares: New Developments in the Theory and Applications (1991), North-Holland, Amsterdam
13. Fahle T., Shamberger S., and Sellman M. Symmetry breaking. In: Walsh T. (Ed). Proceedings of CP2001. LNCS 2293 (2001), Springer 93-107
14. In: Freuder E.C., and Wallace R.J. (Eds). Constraint Programming and Large Scale Discrete Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 57 (1998), American Mathematical Society
15. Gent I.P., and Smith B.M. Symmetry breaking in constraint programming. In: Horn W. (Ed). Proceedings of ECAI'00 (2000), IOS Press 599-603
16. Gomes C., and Shmoys D. The Promise of LP to boost CSP techniques for combinatorial problems. Proceedings of CP-AI-OR'02 (2002), Le Croisic, France 291-305
17. Harvey, W., 2001. Symmetry breaking and the social golfer problem. In: Flener, P., Pearson, J. (Eds.), Proceedings of SymCon'01: Symmetry in Constraints. pp. 9-16.
18. Hooker J.N. Logic-based Methods for Optimization: Combining Optimization and Constraint Satisfaction (2000), John Wiley, New York
19. Hooker, J.N., 2004. A hybrid method for planning and scheduling. In: Wallace, M. (Ed.), Proceedings of CP2004, LNCS 3258. pp. 305-316.
20. Hooker J.N., and Osorio M.A. Mixed logical/linear programming. Discrete Applied Mathematics (1994) 96-97 395-442
21. Jungnickel D., and Storme L. Maximal partial spreads in PG(3,4) and maximal sets of mutually orthogonal Latin squares of order 16. Discrete Mathematics 261 (2003) 361-371
22. Lam C.W.H. The search for a finite projective plane of order 10. American Mathematical Monthly 98 (1991) 305-318
23. Laywine C.F., and Mullen G.L. Discrete Mathematics Using Latin Squares (1998), John Wiley, New York
24. Padberg M.W. On the facial structure of set packing polyhedra. Mathematical Programming 5 (1973) 199-215
25. Puget J.F. Symmetry breaking revisited. In: Van Hentenryck P. (Ed). Proceedings of CP2002. LNCS 2470 (2002), Springer 446-461
26. Régin, J.C., 1994. A filtering algorithm for constraints of difference in CSPs. In: Proceedings of AAAI-94, pp. 362-367.
27. Savelsbergh M.W.P. Preprocessing and probing for mixed integer programming problems. ORSA Journal on Computing 6 (1994) 445-454
28. Trotter L. A class of facet-producing graphs for vertex packing polyhedra. Discrete Mathematics 12 (1975) 373-388
29. Wright S.J. Primal-dual Interior-point Methods (1997), SIAM, Philadelphia
30. Zhang, H., Hsiang, J., 1994. Solving open quasigroup problems by propositional reasoning. In: Proceedings of the International Computer Symposium, Hsinchu, Taiwan.