Some models of graphs for scheduling sports competitions
Discrete Applied Mathematics
A constrained sports scheduling problem
Discrete Applied Mathematics
Combinatorial aspects of construction of competition Dutch Professional Football Leagues
Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Constraint-based round robin tournament planning
Proceedings of the 1999 international conference on Logic programming
Minimization of the number of breaks in sports scheduling problems using constraint programming
DIMACS workshop on on Constraint programming and large scale discrete optimization
Scheduling a Major College Basketball Conference
Operations Research
Scheduling a Major College Basketball Conference--Revisited
Operations Research
Matching Theory (North-Holland mathematics studies)
Matching Theory (North-Holland mathematics studies)
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
On the application of graph colouring techniques in round-robin sports scheduling
Computers and Operations Research
A wide-ranging computational comparison of high-performance graph colouring algorithms
Computers and Operations Research
Solving effectively the school timetabling problem using particle swarm optimization
Expert Systems with Applications: An International Journal
Mirrored traveling tournament problem: an evolutionary approach
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
Semidefinite programming based approaches to home-away assignment problems in sports scheduling
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
The timetable constrained distance minimization problem
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Sports tournaments, home-away assignments, and the break minimization problem
Discrete Optimization
Minimizing breaks by maximizing cuts
Operations Research Letters
A polynomial-time algorithm to find an equitable home-away assignment
Operations Research Letters
A hybrid particle swarm optimization based algorithm for high school timetabling problems
Applied Soft Computing
| Hi-index | 0.02 |
Sports timetabling algorithms need to be able to handle a wide varietyof requirements. We present a two-phase method in which the first phase is to schedule the teams ignoring anyhome and away requirements and the second phase is to assign the home and away teams. This approach is appropriate when there are requirements on the schedule that do not involve the home and away patterns. Examples of this include fixed game assignments and restrictions on the effect carryovers can have. These requirements can be met earlyin the process and the best home and away patterns can then be found for the resulting schedules.