Finding orthogonal latin squares using finite model searching tools

Feifei Ma, Jian ZhangScience China Information Sciences 2013 · OpenReview

Abstract

An important class of problems in combinatorics is to find orthogonal latin squares with certain properties. Computer search is a promising approach for solving such problems. But generally its worst-case complexity is high. This paper describes how to use a general-purpose model searching program to find orthogonal latin squares. New techniques for problem representation and symmetry breaking are proposed to increase search efficiency.
BibTeX
@article{ma2013finding,
  author = {Feifei Ma and Jian Zhang},
  title = {{Finding orthogonal latin squares using finite model searching tools}},
  journal = {Science China Information Sciences},
  year = {2013},
  url = {https://openreview.net/forum?id=imDYr15nBQ4},
}

Loading related content...

Figure