旅行比武问题的一个新下界

2007 IEEE Symposium on Computational Intelligence in Scheduling Pub Date : 2007-04-01 DOI:10.1109/SCIS.2007.367664

S. Urrutia, C. Ribeiro, Rafael A. Melo

{"title":"旅行比武问题的一个新下界","authors":"S. Urrutia, C. Ribeiro, Rafael A. Melo","doi":"10.1109/SCIS.2007.367664","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"A New Lower Bound to the Traveling Tournament Problem\",\"authors\":\"S. Urrutia, C. Ribeiro, Rafael A. Melo\",\"doi\":\"10.1109/SCIS.2007.367664\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":184726,\"journal\":{\"name\":\"2007 IEEE Symposium on Computational Intelligence in Scheduling\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Symposium on Computational Intelligence in Scheduling\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCIS.2007.367664\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Symposium on Computational Intelligence in Scheduling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCIS.2007.367664","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 20

摘要

体育优化是一个越来越受关注的领域。巡回赛问题抽象了体育运动调度问题的某些特征。我们提出了一种确定该问题下界的新方法。新的下界改进了以前已知的下界。在基准实例上的数值结果显示，下限和上限之间的差距减少了38.6%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A New Lower Bound to the Traveling Tournament Problem

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 IEEE Symposium on Computational Intelligence in Scheduling

自引率

0.00%

发文量