Scheduling asynchronous round-robin tournaments
Author:
- Warut SuksompongWSWarut Suksompong
- 1 January 2016
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 44 (1) , 96-100
Abstract
No abstract availableAll Related Versions
Funding Information
- Stanford Graduate Fellowship
This publication has 12 references indexed in Scilit:
- Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaksOperations Research Letters, 2013
- Constructing fair round robin tournaments with a minimum number of breaksOperations Research Letters, 2010
- Constructing fair sports league schedules with regard to strength groupsDiscrete Applied Mathematics, 2010
- Scheduling non-professional table-tennis leaguesEuropean Journal of Operational Research, 2010
- Combinatorial properties of strength groups in round robin tournamentsEuropean Journal of Operational Research, 2009
- Round robin scheduling – a surveyEuropean Journal of Operational Research, 2008
- Scheduling sports tournaments on a single court minimizing waiting timesOperations Research Letters, 2008
- Memetic Algorithm timetabling for non-commercial sport leaguesEuropean Journal of Operational Research, 2004
- Scheduling sports competitions with a given distribution of timesDiscrete Applied Mathematics, 1988
- A Tournament Design ProblemThe American Mathematical Monthly, 1977