In sports timetabling, creating an appropriate timetable for a round-robin tournament with home–away assignment is a significant problem. To solve this problem, we need to construct home–away assignment that can be completed into a timetable; such assignment is called a feasible pattern set. Although finding feasible pattern sets is at the heart of many… (More)
This paper concerns the method of selecting the best subset of explanatory variables in a multiple linear regression model. To evaluate a subset regression model, some goodness-of-fit measures, e.g., adjusted R 2 , AIC and BIC, are generally employed. Although variable selection is usually handled via a stepwise regression method, the method does not always… (More)
We propose a polynomial-time algorithm to find an equitable home–away assignment for a given timetable of a round-robin tournament. Our results give an answer to a problem raised by Elf et al. (Oper. Res. Lett. 31 (2003) 343), which concerns the computational complexity of the break minimization problem in sports timetabling.
This paper considers the break minimization problem in sports timetabling. The problem is to find, under a given timetable of a round-robin tournament, a home-away assignment that minimizes the number of breaks, i.e., the number of occurrences of consecutive matches held either both at away or both at home for a team. We formulate the break minimization… (More)
In this abstract, we deal with the Constant Distance Traveling Tournament Problem (CDTTP) , which is a special class of the Traveling Tournament Problem (TTP), established by Easton, Nemhauser and Trick . We propose a lower bound of the optimal value of CDTTP, and two algorithms that produce feasible solutions whose objective values are close to the… (More)
The METR technical reports are published as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this… (More)
For a given schedule of a round-robin tournament and a matrix of distances between homes of teams, an optimal home-away assignment problem is to find a home-away assignment that minimizes the total traveling distance. We propose a technique to transform the problem to MIN RES CUT. We apply Goemans and Williamson's 0.878-approximation algorithm for MAX RES… (More)