HackerPapers

arXiv:1410.2721cs.DS

A note on a sports league scheduling problem

Jean-Philippe Hamiez, Jin-Kao Hao

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

Sports league scheduling is a difficult task in the general case. In this short note, we report two improvements to an existing enumerative search algorithm for a NP-hard sports league scheduling problem known as "prob026" in CSPLib. These improvements are based on additional rules to constraint and accelerate the enumeration process. The proposed approach is able to find a solution (schedule) for all prob026 instances for a number T of teams ranging from 12 to 70, including several T values for which a solution is reported for the first time.

arXiv comments
9 pages
Journal reference
DOI
Subjects
cs.DSData Structures and Algorithms

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Oct 2014 to Oct 2014. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.