Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
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
Artificial Intelligence
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Solving the Sports League Scheduling Problem with Tabu Search
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
A Schedule-Then-Break Approach to Sports Timetabling
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Constraint Generation via Automated Theory Formation
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of CSPLib)
Discrete Applied Mathematics
College basketball scheduling with travel swings
Computers and Industrial Engineering
Compiling problem specification into SAT
Artificial Intelligence - Special volume on reformulation
A constraint programming approach to the multiple-venue, sport-scheduling problem
Computers and Operations Research
Scheduling the professional soccer leagues of Austria and Germany
Computers and Operations Research
Compiling problem specifications into SAT
Artificial Intelligence - Special volume on reformulation
College basketball scheduling with travel swings
Computers and Industrial Engineering
A 25-year perspective on logic programming
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
| Hi-index | 0.00 |
We tackle the problem of scheduling the matches of around robin tournament for a sport league. We formally definethe problem, state its computational complexity, and presenta solution algorithm using a two-step approach. The first stepis the creation of a tournament pattern and is based on knowngraph-theoretic results. The second one is an assignment problemand it is solved using a constraint-based depth-first branchand bound procedure that assigns actual teams to numbers in thepattern. The procedure is implemented using the finite domainlibrary of the constraint logic programming language \eclipse.Experimental results show that, in practical cases, the optimalsolution of the assignment problem (which is not necessarilyoptimal for the overall problem) can be found in reasonable time,despite the fact that the problem is NP-complete. In addition,a local search procedure has been developed in order to provide,when necessary, an approximate solution in shorter time.