An efficient SAT encoding for solving The Social Golfer Problem.

Saved in:

Bibliographic Details
Title:	An efficient SAT encoding for solving The Social Golfer Problem.
Authors:	Van Kieu, Tuyen¹ (AUTHOR) khanhtv@vnu.edu.vn, Nguyen, Nguyen Tan¹ (AUTHOR), Van To, Khanh¹ (AUTHOR) khanhtv@vnu.edu.vn
Source:	RAIRO: Operations Research (2804-7303). 2026, Vol. 60 Issue 1, p173-199. 27p.
Subjects:	Combinatorial optimization, NP-complete problems, Constraint satisfaction, Benchmark problems (Computer science), Proposition (Logic)
Abstract:	The Social Golfer Problem (SGP), a classic NP-complete combinatorial optimization chal- lenge, poses significant scalability issues for automated solvers. To address these limitations, this paper introduces a novel and efficient SAT encoding, the New SAT Encoding (NSE). NSE employs a com- pact three-index variable representation and integrates the New Sequential Counter (NSC) encoding, the proposed technique for Exactly K cardinality constraints, specifically for the SGP's Group Size constraint. Rigorous experimental evaluation against established encodings, including Triska–Musliu Encoding and Set Constraint Encoding, demonstrates NSE's superior robustness and performance. Notably, NSE solves a larger number of SGP instances, including the previously intractable 6–3–8 benchmark, outperforming existing SAT-based approaches. While NSE may exhibit a slightly larger clause count in certain configurations, its significantly reduced variable count and solver-friendly CNF structure, enabled by NSC, facilitate enhanced constraint propagation and search efficiency. These results highlight the effectiveness of the NSE encoding and the NSC technique, advancing the state-of- the-art SAT-based solutions for complex combinatorial problems like the Social Golfer Problem. [ABSTRACT FROM AUTHOR]
	Copyright of RAIRO: Operations Research (2804-7303) is the property of EDP Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	The Social Golfer Problem (SGP), a classic NP-complete combinatorial optimization chal- lenge, poses significant scalability issues for automated solvers. To address these limitations, this paper introduces a novel and efficient SAT encoding, the New SAT Encoding (NSE). NSE employs a com- pact three-index variable representation and integrates the New Sequential Counter (NSC) encoding, the proposed technique for Exactly K cardinality constraints, specifically for the SGP's Group Size constraint. Rigorous experimental evaluation against established encodings, including Triska–Musliu Encoding and Set Constraint Encoding, demonstrates NSE's superior robustness and performance. Notably, NSE solves a larger number of SGP instances, including the previously intractable 6–3–8 benchmark, outperforming existing SAT-based approaches. While NSE may exhibit a slightly larger clause count in certain configurations, its significantly reduced variable count and solver-friendly CNF structure, enabled by NSC, facilitate enhanced constraint propagation and search efficiency. These results highlight the effectiveness of the NSE encoding and the NSC technique, advancing the state-of- the-art SAT-based solutions for complex combinatorial problems like the Social Golfer Problem. [ABSTRACT FROM AUTHOR]
ISSN:	28047303
DOI:	10.1051/ro/2025155