For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling
Ayami SUZUKA Ryuhei MIYASHIRO Akiko YOSHISE Tomomi MATSUI
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/05/01
Online ISSN: 1745-1337
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
sports scheduling, timetabling, approximation algorithm, dependent randomized rounding,
Full Text: PDF(252.8KB)>>
Suppose that we have a timetable of a round-robin tournament with a number of teams, and distances among their homes. The home-away assignment problem is to find a home-away assignment that minimizes the total traveling distance of the teams. We propose a formulation of the home-away assignment problem as an integer program, and a rounding algorithm based on Bertsimas, Teo and Vohra's dependent randomized rounding method . Computational experiments show that our method quickly generates feasible solutions close to optimal.