| Article ID: | iaor20101720 |
| Volume: | 38 |
| Issue: | 2 |
| Start Page Number: | 121 |
| End Page Number: | 122 |
| Publication Date: | Mar 2010 |
| Journal: | Operations Research Letters |
| Authors: | Horbach Andrei |
| Keywords: | tournament games |
We prove a new combinatorial property of the maximum round robin tournament (MRRT) problem. This property allows us to answer negatively the question of Briskorn, whether the optimal objective value of the MRRT problem and that of its conventional linear relaxation always coincide.