research
∙
12/18/2022
Unconstrained Traveling Tournament Problem is APX-complete
We show that the Unconstrained Traveling Tournament Problem (UTTP) is AP...
share
research
∙
03/19/2021
Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares
In this paper we provide results on using integer programming (IP) and c...
research
∙
12/08/2020
A SAT-based Resolution of Lam's Problem
In 1989, computer searches by Lam, Thiel, and Swiercz experimentally res...
research
∙
01/31/2020
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten
In 1983, a computer search was performed for ovals in a projective plane...
research
∙
01/31/2020
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem
In the 1970s and 1980s, searches performed by L. Carter, C. Lam, L. Thie...
research
∙
08/28/2019
Revisiting a Cutting Plane Method for Perfect Matchings
In 2016, Chandrasekaran, Végh, and Vempala published a method to solve t...
research
∙
10/27/2017
Improved approximation of layout problems on random graphs
Inspired by previous work of Diaz, Petit, Serna, and Trevisan (Approxima...
research
∙
11/27/2016
