Note: Solving mirrored traveling tournament problem benchmark instances with eight teams

Authors:
K. K. H. Cheung
Affiliations:
School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, ON K1S 5B6, Canada
Venue:
Discrete Optimization
Year:
2008

Citing 6
Cited 2

The Traveling Tournament Problem Description and Benchmarks

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A simulated annealing approach to the traveling tournament problem

Journal of Scheduling
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem

Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Constructive algorithms for the constant distance traveling tournament problem

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
The timetable constrained distance minimization problem

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Traveling tournament scheduling: a systematic evaluation of simulated annealling

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

A Benders approach for computing lower bounds for the mirrored traveling tournament problem

Discrete Optimization
New models for the Mirrored Traveling Tournament Problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

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/.