Sailing League Problems
Abstract
We describe a class of combinatorial design problems which typically occur in professional sailing league competitions. We discuss connections to resolvable block designs and equitable coverings and to scheduling problems in operations research. We in particular give suitable boolean quadratic and integer linear optimization problem formulations, as well as further heuristics and restrictions, that can be used to solve sailing league problems in practice. We apply those techniques to three case studies obtained from real sailing leagues and compare the results with previously used tournament plans.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.