• DocumentCode
    2709322
  • Title

    A New Lower Bound to the Traveling Tournament Problem

  • Author

    Urrutia, Sebastián ; Ribeiro, Celso C. ; Melo, Rafael A.

  • Author_Institution
    Dept. of Comput. Sci., Univ. Fed. de Minas Gerais, Belo Horizonte
  • fYear
    2007
  • fDate
    1-5 April 2007
  • Firstpage
    15
  • Lastpage
    18
  • 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.
  • Keywords
    scheduling; sport; travelling salesman problems; lower bound; optimization; sports scheduling; traveling tournament problem; Abstracts; Cities and towns; Computational intelligence; Computer science; Processor scheduling; Qualifications; Repeaters; Round robin; Scholarships; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence in Scheduling, 2007. SCIS '07. IEEE Symposium on
  • Conference_Location
    Honolulu, HI
  • Print_ISBN
    1-4244-0704-4
  • Type

    conf

  • DOI
    10.1109/SCIS.2007.367664
  • Filename
    4218591
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2709322