An efficient SAT encoding for solving the social golfer problem

DOI10.1051/RO/2025155MaRDI QIDQ6834946zbMATH OpenFDO

Authors Tuyen van Kieu, Nguyen Tan Nguyen, Khanh van To

Publication date 31 March 2026

Published in RAIRO. Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2025155

zbMATH Keywords

cardinality constraintsSAT encodingsocial golfer problemsport timetabling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

This page was built for publication: An efficient SAT encoding for solving the social golfer problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6834946)