A combinatorial property of the maximum round robin tournament problem

✍ Scribed by Andrei Horbach

• Publisher: Elsevier Science
• Year: 2010
• Tongue: English
• Weight: 430 KB
• Volume: 38
• Category: Article
• ISSN: 0167-6377
• DOI: 10.1016/j.orl.2009.10.008

✦ Synopsis

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.