Feasibility of home-away-pattern sets for round robin tournaments

Operations Research Letters

Volumn 36, Issue 3, 2008, Pages 283-284

  Briskorn, Dirk ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Home away pattern set feasibility problem; Round robin tournaments

Indexed keywords

DECISION MAKING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

HOME-AWAY-PATTERN SET FEASIBILITY PROBLEM; ROUND ROBIN TOURNAMENTS;

SET THEORY;

EID: 43049120308     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2007.09.009     Document Type: Article

References (6)

1. Easton K., Nemhauser G., and Trick M. Sports Scheduling. In: Leung J. (Ed). Handbook of Scheduling (2004), CRC Press 52.1-52.19
2. Ilog Cplex, URL: http://www.ilog.com/products/cplex/ visited at 12, September 2007
3. K. Kashiwabara, Personal communication, 2005
4. Miyashiro R., Iwasaki H., and Matsui T. Characterizing feasible pattern sets with a minimum number of breaks. In: Burke E., and de Causmaecker P. (Eds). Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science vol. 2740 (2003), Springer, Berlin, Germany 78-99
5. Nemhauser G.L., and Trick M.A. Scheduling a Major College Basketball Conference. Operations Research 46 (1998) 1-8
6. Post G.F., and Woeginger G.J. Sports tournaments, Home-Away-Assignments, and the break minimization problem. Discrete Optimization 3 (2006) 165-173