Construction of balanced sports schedules using partitions into subleagues
Operations Research Letters, cilt.36, sa.3, ss.279-282, 2008 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 36 Sayı: 3
- Basım Tarihi: 2008
- Doi Numarası: 10.1016/j.orl.2007.09.007
- Dergi Adı: Operations Research Letters
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Sayfa Sayıları: ss.279-282
- Anahtar Kelimeler: Balanced tournaments, Graeco-Latin squares, Subleagues
- Boğaziçi Üniversitesi Adresli: Evet
Özet
Direct constructions for balanced tournaments known so far solve problems with 2 n teams if 2 n mod 3 ≠ 1 or 2 n = 2p, p ≥ 3 or n is odd. Our construction uses an arbitrary partition of the league into subleagues. It solves more than half of the missing cases and provides structured solutions for some known cases. © 2007 Elsevier Ltd. All rights reserved.