Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem 104 (Travelling Tournament Problem) — Constraint detection

Given n teams , n even , a double round robin tournament -LRB- DRRT -RRB- is a set of games in which each team plays each other team once at home and once away . A schedule for a DRRT is a mapping of games to slots , or time periods , such that each team plays exactly once in each slot . A DRRT schedule covers exactly 2 -LRB- n - 1 -RRB- slots . The distances between the team venues are given by an n by n matrix D. For the distance calculations , it is important to note that each team starts and finishes the tournament at its home venue . A road trip , or trip , is defined as a series of consecutive away games . Similarly , a home stand is defined as a series of consecutive home games . The length of a road trip or home stand is the number of games in the series -LRB- not the travel distance -RRB- . The TTP is defined as follows . Input : a set of n teams T = -LCB- t1 , ... , tn -RCB- with n even ; D a symmetric n by n integer distance matrix with elements dij ; l , u integer parameters , $ l \ le u $ . Output : a double round robin tournament on the teams in T such that the length of every home stand and road trip is between l and u inclusive , and the total distance traveled by the teams is minimized .

Problem 104 (Travelling Tournament Problem) — Detection of the decisions and objects to be modeled

Given n teams , n even , a double round robin tournament -LRB- DRRT -RRB- is a set of games in which each team plays each other team once at home and once away . A schedule for a DRRT is a mapping of games to slots , or time periods , such that each team plays exactly once in each slot . A DRRT schedule covers exactly 2 -LRB- n - 1 -RRB- slots . The distances between the team venues are given by an n by n matrix D. For the distance calculations , it is important to note that each team starts and finishes the tournament at its home venue . A road trip , or trip , is defined as a series of consecutive away games . Similarly , a home stand is defined as a series of consecutive home games . The length of a road trip or home stand is the number of games in the series -LRB- not the travel distance -RRB- . The TTP is defined as follows . Input : a set of n teams T = -LCB- t1 , ... , tn -RCB- with n even ; D a symmetric n by n integer distance matrix with elements dij ; l , u integer parameters , $ l \ le u $ . Output : a double round robin tournament on the teams in T such that the length of every home stand and road trip is between l and u inclusive , and the total distance traveled by the teams is minimized .

Back to list