Abstract
AbstractWe 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
