Scheduling sport tournaments using constraint logic programming

Constraints

Volumn 4, Issue 1, 1999, Pages 43-65

  Schaerf, Andrea ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; GRAPH THEORY; LOGIC PROGRAMMING; PROBLEM SOLVING;

BRANCH AND BOUND METHODS; CONSTRAINT LOGIC PROGRAMMING; SPORT TOURNAMENTS;

SCHEDULING;

EID: 0032659479     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009845710839     Document Type: Article

References (33)

1. R. R. Bakker, F. Dikker, F. Tempelman, and P. M. Wognum. (1993). Diagnosing and solving over-determined constraints satisfaction problems. In Proc. of the 13th Int. Joint Conf. on Artificial Intelligence (IJCAI-93), Morgan Kaufmann, pages 276-281.
2. W. O. Cain, Jr. (1977). The computer-assisted heuristic approach used to schedule the major league baseball clubs. In S. P. Ladany and R. E. Machol, editors, Optimal Strategies in Sports, North-Holland, Amsterdam, pages 32-41.
3. Robert Thomas Campbell and Der San Chen. (1976). A minimum distance basketball scheduling problem. In R. E. Machol, S. P. Ladany, and D. G. Morrison, editors, Management Science in Sports, North-Holland, Amsterdam, pages 15-25.
4. Charles J. Colbourn. (1983). Embedding partial Steiner triple systems is NP-complete. Journal of Combinatorial Theory, Series A 35:100-105.
5. D. Costa. (1995). An evolutionary tabu search algorithm and the NHL scheduling problem. INFOR, 33(3):161-178.
6. D. de Werra. L. Jacot-Descombes, and P. Masson. (1990). A constrained sports scheduling problem. Discrete Applied Mathematics, 26:41-49.
7. D. de Werra. (1980). Geography, games and graphs. Discrete Applied Mathematics, 2:327-337.
8. D. de Werra. Scheduling in sports. (1981). In P. Hansen, editor, Studies on Graphs and Discrete Programming, North Holland, pages 381-395.
9. D. de Werra. (1985). On the multiplication of divisions: The use of graphs for sports scheduling. Networks, 15:125-136.
10. e Extensions User Manual (Version 3.5.2).
11. e User Manual (Version 3.5.2).
12. J. A. Ferland and C. Fleurent. (1991). Computer aided scheduling for a sport league. INFOR, 29:14-25.
13. Eric N. Gelling and Robert E. Odeh. (1973). On 1-factorizations of the complete graph and the relationship to round robin schedules. In Third Manitoba Conference on Numerical Math., pages 214-221.
14. M. L. Ginsberg and W. D. Harvey. (1992). Iterative broadening. Artificial Intelligence, 55(2-3):367-383.
15. 5/2 algorithm for maximum matching in bipartite graphs. SIAM Journal of Computation, 2:225-231.
16. Alon Itai, Michael Rodeh, and Steven L. Tanimoto. (1977). Some matching problems for bipartite graphs. Technical Report TR93, IBM Israel Scientific Center, Haifa, Israel.
17. Joxan Jaffar and Michael Maher. (1994). Constraint logic programming: a survey. Journal of Logic Programming, 19/20:503-581.
18. Thierry Le Provost and Mark Wallace. (1993). Generalized constraint propagation over the CLP scheme. Journal of Logic Programming, 16:319-359.
19. Charles C. Lindner, Eric Mendelsohn, and Alexander Rosa. (1976). On the number of 1-factorizations of the complete graph. Journal of Combinatorial Theory, Series B 20:265-282.
20. Ken McAloon, Carol Tretkoff, and Gerhard Wetzel. (1997). Sport league scheduling. In Annual ILOG Optimization Users Conference.
21. Eric Mendelsohn and Alexander Rosa. (1985). One-factorizations of the complete graph - a survey. Journal of Graph Theory, 9:43-65.
22. Steven Minton, Mark D. Johnston, Andrew B. Philips, and Philip Laird. (1992). Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161-205.
23. George Nemhauser and Michael Trick. (1997). Scheduling a major college basketball conference. In Proc. of the 2nd Int. Conf. on the Practice and Theory of Automated Timetabling, pages 334-336.
24. Jean-Charles Régin. (1994). A filtering algorithm for constraints of difference in CSPs. In Proc. of the 12th Nat. Conf. on Artificial Intelligence (AAAI-94), pages 362-367.
25. Alexander Rosa and Walter D. Wallis. (1982). Premature sets of 1-factors or how not to schedule round robin tournaments. Discrete Applied Mathematics, 4:291-297.
26. K. G. Russell. (1980). Balancing carry-over effects in round robin tournaments. Biometrika, 67(1):127-131.
27. J. A. M. Schreuder. (1980). Constructing timetables for sport competitions. Mathematical Programming Study, 13:58-67.
28. J. A. M. Schreuder. (1992). Combinatorial aspects of construction of competition dutch professional football leagues. Discrete Applied Mathematics, 35:301-312.
29. J. A. M. Schreuder. (1993). Construction of fixture lists for professional football leagues. PhD thesis, Department of Management Science, The University of Strathclyde, Glasgow.
30. T. H. Straley. (1983). Scheduling designs for a league tournament. Ars Combinatorica, 15:193-200.
31. Pascal Van Hentenryck. (1989). Constraint Satisfaction in Logic Programming. MIT Press.
32. W. D. Wallis, A. P. Street, and J. S. Wallis. (1972). Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices. Number 292 in Lecture Notes in Mathematics. New York: Springer-Verlag.
33. W. D. Wallis. (1983). A tournament problem. Journal of the Australian Mathematical Society, Series B 24:289-291.