This work presents algorithms to achieve optimal solutions for social golfer problem instances, indicating new combinatorial design applications.
Resolvable combinatorial designs including Resolvable Balanced Incomplete Block Designs, Resolvable Group Divisible Designs, Uniformly Resolvable Designs and Mutually Orthogonal Latin Squares and Rectangles are used to construct optimal solutions to the Social Golfer problem (SGP) and the Social Golfer problem with adjacent group sizes (SGA). An algorithm is presented to find an optimal solution in general, and a complete set of solutions is provided for up to 150 players.
No takes yet. Share an insight, caveat, or question.
Miller et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: