Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Solving Combinatorial Problems with Regular Local Search Algorithms
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Solving the Sports League Scheduling Problem with Tabu Search
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
Solving the Round Robin Problem Using Propositional Logic
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
CSPLIB: A Benchmark Library for Constraints
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Breaking Row and Column Symmetries in Matrix Models
CP '02 Proceedings of the 8th 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
| Hi-index | 0.00 |
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the best known constraint programing algorithm is limited to T≤40. The proposed approach relies on interesting properties which are used to constraint the search process.