Solving mirrored traveling tournament problem benchmark instances with eight teams

Solving mirrored traveling tournament problem benchmark instances with eight teams

0.00 Avg rating0 Votes
Article ID: iaor2009323
Country: Netherlands
Volume: 5
Issue: 1
Start Page Number: 138
End Page Number: 143
Publication Date: Feb 2008
Journal: Discrete Optimization
Authors:
Keywords: programming: integer, sports
Abstract:

A two-phase method based on generating timetables from one-factorizations and finding optimal home/away assignments solved the mirrored traveling tournament problem benchmark instances NL8 and CIRC8 at the Challenge Traveling Tournament Problems homepage http://mat.gsia.cmu.edu/TOURN/.

Reviews

Required fields are marked *. Your email address will not be published.