2001 | OriginalPaper | Buchkapitel
The Traveling Tournament Problem Description and Benchmarks
verfasst von : Kelly Easton, George Nemhauser, Michael Trick
Erschienen in: Principles and Practice of Constraint Programming — CP 2001
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 dificult 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.