Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1141713 | Discrete Optimization | 2008 | 6 Pages |
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/.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
K.K.H. Cheung,