By Topic

A New Lower Bound to the Traveling Tournament Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sebastian Urrutia ; Department of Computer Science, Universidade Federal de Minas Gerais, Av. Antônio Carlos 6627, Belo Horizonte, MG 31270-010, Brazil. e-mail: surrutia@dcc.ufmg.br ; Celso C. Ribeiro ; Rafael A. Melo

Optimization in sports is a field of increasing interest. The traveling tournament problem abstracts certain characteristics of sports scheduling problems. We propose a new method for determining a lower bound to this problem. The new bound improves upon the previously best known lower bound. Numerical results on benchmark instances showed reductions as large as 38.6% in the gaps between lower and upper bounds.

Published in:

2007 IEEE Symposium on Computational Intelligence in Scheduling

Date of Conference:

1-5 April 2007