Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares

03/19/2021
by   Noah Rubin, et al.
0

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 paradigms have previously successfully been used to search for MOLS, but solvers for IP and CP solvers have significantly improved in recent years and data on how modern IP and CP solvers perform on the MOLS problem is lacking. Using state-of-the-art solvers as black boxes we were able to quickly find pairs of MOLS (or prove their nonexistence) in all orders up to ten. Moreover, we improve the effectiveness of the solvers by formulating an extended symmetry breaking method as well as an improvement to the straightforward CP encoding. We also analyze the effectiveness of using CP and IP solvers to search for triples of MOLS, compare our timings to those which have been previously published, and estimate the running time of using this approach to resolve the longstanding open problem of determining the existence of a triple of MOLS of order ten.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2017

SUNNY-CP and the MiniZinc Challenge

In Constraint Programming (CP) a portfolio solver combines a variety of ...
research
06/19/2013

Structure Based Extended Resolution for Constraint Programming

Nogood learning is a powerful approach to reducing search in Constraint ...
research
11/09/2018

Stratified Constructive Disjunction and Negation in Constraint Programming

Constraint Programming (CP) is a powerful declarative programming paradi...
research
02/06/2014

Combining finite and continuous solvers

Combining efficiency with reliability within CP systems is one of the ma...
research
06/15/2012

Improving the Asymmetric TSP by Considering Graph Structure

Recent works on cost based relaxations have improved Constraint Programm...
research
11/25/2020

Cable Tree Wiring – Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints

Cable trees are used in industrial products to transmit energy and infor...
research
09/07/2020

sunny-as2: Enhancing SUNNY for Algorithm Selection

SUNNY is an Algorithm Selection (AS) technique originally tailored for C...

Please sign up or login with your details

Forgot password? Click here to reset