Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1141592 | Discrete Optimization | 2009 | 8 Pages |
Abstract
A Benders approach for computing lower bounds for the mirrored Traveling Tournament Problem is proposed. The method obtained improved lower bounds for a number of benchmark instances at the Challenge Traveling Tournament Problems homepage http://mat.gsia.cmu.edu/TOURN/.
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
Kevin K.H. Cheung,