An improved SAT formulation for the social golfer problem

An improved SAT formulation for the social golfer problem

0.00 Avg rating0 Votes
Article ID: iaor2012863
Volume: 194
Issue: 1
Start Page Number: 427
End Page Number: 438
Publication Date: Apr 2012
Journal: Annals of Operations Research
Authors: ,
Keywords: boolean programming, golf, satisfiability
Abstract:

The Social Golfer Problem (SGP) is a sports scheduling problem that exhibits a lot of symmetry and has recently attracted significant attention. In this paper, we first revisit an existing SAT encoding for the SGP and correct some of its clauses. We then propose a change in the encoding that significantly reduces the number of variables for all instances. We achieve considerable performance improvements when solving many SGP instances with common SAT solvers using local search and complete backtracking. This makes SAT formulations a more promising approach for solving the SGP than previously.

Reviews

Required fields are marked *. Your email address will not be published.