A new lower bound to the traveling tournament problem

被引：10
|
作者：
Urrutia, Sebastian [1 ]
Ribeiro, Celso C. [1 ]
Melo, Rafael A. [1 ]
机构：
[1] Univ Fed Minas Gerais, Dept Comp Sci, Av Antonio Carlos 6627, BR-31270010 Belo Horizonte, MG, Brazil
来源：
2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN SCHEDULING | 2007年
关键词：
D O I：
10.1109/SCIS.2007.367664
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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. T he-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.
引用
收藏
页码：15 / +
页数：2
相关论文
共 50 条
12345