A solution to a Partitioned Balanced Tournament Design of side 11
Federico Della Croce, Gabriele Dragotto, Fabio Salassa
TL;DR
This paper presents a combinatorial optimization approach to solve the Partitioned Balanced Tournament Design problem specifically for side 11, contributing to the field of combinatorial design theory.
Contribution
It provides the first known explicit solution for PBTD of side 11 using optimization techniques.
Findings
Successfully generated a solution for PBTD of side 11.
Demonstrated effectiveness of combinatorial optimization in design problems.
Advances the understanding of partitioned balanced tournament designs.
Abstract
We provide a solution to the Partitioned Balanced Tournament Design of side . The solution has been generated by exploiting combinatorial optimization methods.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOperations Management Techniques