Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling

Ayami SUZUKA  Ryuhei MIYASHIRO  Akiko YOSHISE  Tomomi MATSUI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E89-A   No.5   pp.1407-1416
Publication Date: 2006/05/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e89-a.5.1407
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
sports scheduling,  timetabling,  approximation algorithm,  dependent randomized rounding,  

Full Text: PDF(252.8KB)>>
Buy this Article




Summary: 
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 [2]. Computational experiments show that our method quickly generates feasible solutions close to optimal.