The Traveling Tournament Problem Description and Benchmarks

著者: Kelly Easton, George L. Nemhauser, Michael A. Trick - Lecture notes in computer science 2001 被引用: 224

The Traveling Tournament Problem is a sports timetabling problem that abstracts two issues in creating timetables: home/away pattern feasibility and team travel. Instances of this problem seem to be very difficult even for a very small number of teams, making it an interesting challenge for combinatorial optimization techniques such as integer programming and constraint programming. We introduce the problem, describe one way of modeling it, and give some interesting classes of instances with base computational results.