# A solution to a Partitioned Balanced Tournament Design of side 11

## 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.

## Key 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 $(PBTD)$ of side $11$. The solution has been generated by exploiting combinatorial optimization methods.

---
Source: https://tomesphere.com/paper/1903.06166