32 citations · 44 across the 9 of their papers we have counts for
11 papers
Unconstrained Traveling Tournament Problem is APX-complete
Salomon Bendayan, Joseph Cheriyan, Kevin K. H. Cheung
We show that the Unconstrained Traveling Tournament Problem (UTTP) is APX-complete by presenting an L-reduction from a version of metric (1,2)-TSP to UTTP. Keywords: Traveling Tour…
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…
A SAT-based Resolution of Lam's Problem
Curtis Bright, Kevin K. H. Cheung, Brett Stevens +2
In 1989, computer searches by Lam, Thiel, and Swiercz experimentally resolved Lam's problem from projective geometry$\unicode{x2014}$the long-standing problem of determining if a p…
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten
Curtis Bright, Kevin K. H. Cheung, Brett Stevens +2
In 1983, a computer search was performed for ovals in a projective plane of order ten. The search was exhaustive and negative, implying that such ovals do not exist. However, no no…
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem
Curtis Bright, Kevin K. H. Cheung, Brett Stevens +2
In the 1970s and 1980s, searches performed by L. Carter, C. Lam, L. Thiel, and S. Swiercz showed that projective planes of order ten with weight 16 codewords do not exist. These se…
A Nonexistence Certificate for Projective Planes of Order Ten with Weight 15 Codewords
Curtis Bright, Kevin Cheung, Brett Stevens +3
Using techniques from the fields of symbolic computation and satisfiability checking we verify one of the cases used in the landmark result that projective planes of order ten do n…