Brett Stevens

most citedInteger and Constraint Programming Revisited for Mutually Orthogonal Latin Squares

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2025

Orthogonal Latin Squares of Order Ten with Two Relations: A SAT Investigation

Curtis Bright, Amadou Keita, Brett Stevens

A $k$ -net( $n$ ) is a combinatorial design equivalent to $k - 2$ mutually orthogonal Latin squares of order $n$ . A relation in a net is a linear dependency over $F_{2}$ in the i…

math.CO2025

Myrvold's Results on Orthogonal Triples of $10 \times 10$ Latin Squares: A SAT Investigation

Curtis Bright, Amadou Keita, Brett Stevens

Ever since E. T. Parker constructed an orthogonal pair of $10 \times 10$ Latin squares in 1959, an orthogonal triple of $10 \times 10$ Latin squares has been one of the most sought-aft…

cs.DM2021★ 1 cited

Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares

Noah Rubin, Curtis Bright, Kevin K. H. Cheung +1

In this paper we provide results on using integer programming (IP) and constraint programming (CP) to search for sets of mutually orthogonal latin squares (MOLS). Both programming…

Orthogonal Latin Squares of Order Ten with Two Relations: A SAT Investigation

Myrvold's Results on Orthogonal Triples of 10×10 Latin Squares: A SAT Investigation

Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares

Myrvold's Results on Orthogonal Triples of $10 \times 10$ Latin Squares: A SAT Investigation