An efficient SAT encoding for solving The Social Golfer Problem.
Saved in:
| Title: | An efficient SAT encoding for solving The Social Golfer Problem. |
|---|---|
| Authors: | Van Kieu, Tuyen1 (AUTHOR) khanhtv@vnu.edu.vn, Nguyen, Nguyen Tan1 (AUTHOR), Van To, Khanh1 (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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 192633517 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: An efficient SAT encoding for solving The Social Golfer Problem. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Van+Kieu%2C+Tuyen%22">Van Kieu, Tuyen</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> khanhtv@vnu.edu.vn</i><br /><searchLink fieldCode="AR" term="%22Nguyen%2C+Nguyen+Tan%22">Nguyen, Nguyen Tan</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Van+To%2C+Khanh%22">Van To, Khanh</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> khanhtv@vnu.edu.vn</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22RAIRO%3A+Operations+Research+%282804-7303%29%22">RAIRO: Operations Research (2804-7303)</searchLink>. 2026, Vol. 60 Issue 1, p173-199. 27p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Combinatorial+optimization%22">Combinatorial optimization</searchLink><br /><searchLink fieldCode="DE" term="%22NP-complete+problems%22">NP-complete problems</searchLink><br /><searchLink fieldCode="DE" term="%22Constraint+satisfaction%22">Constraint satisfaction</searchLink><br /><searchLink fieldCode="DE" term="%22Benchmark+problems+%28Computer+science%29%22">Benchmark problems (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Proposition+%28Logic%29%22">Proposition (Logic)</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=192633517 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1051/ro/2025155 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 27 StartPage: 173 Subjects: – SubjectFull: Combinatorial optimization Type: general – SubjectFull: NP-complete problems Type: general – SubjectFull: Constraint satisfaction Type: general – SubjectFull: Benchmark problems (Computer science) Type: general – SubjectFull: Proposition (Logic) Type: general Titles: – TitleFull: An efficient SAT encoding for solving The Social Golfer Problem. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Van Kieu, Tuyen – PersonEntity: Name: NameFull: Nguyen, Nguyen Tan – PersonEntity: Name: NameFull: Van To, Khanh IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Text: 2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 28047303 Numbering: – Type: volume Value: 60 – Type: issue Value: 1 Titles: – TitleFull: RAIRO: Operations Research (2804-7303) Type: main |
| ResultId | 1 |
