An Entity of Type: disease, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

The traveling tournament problem (TTP) is a mathematical optimization problem. The question involves scheduling a series of teams such that: 1. * Each team plays every other team twice, once at home and once in the other's stadium. 2. * No team plays the same opponent in two consecutive weeks. 3. * No team plays more than three games in a row at home, or three games in a row on the road. There have been many papers published on the subject, and a contest exists to find the best solutions for certain specific schedules.

Property Value
dbo:abstract
  • The traveling tournament problem (TTP) is a mathematical optimization problem. The question involves scheduling a series of teams such that: 1. * Each team plays every other team twice, once at home and once in the other's stadium. 2. * No team plays the same opponent in two consecutive weeks. 3. * No team plays more than three games in a row at home, or three games in a row on the road. A matrix is provided of the travel distances between each team's home city. All teams start and end at their own home city, and the goal is to minimize the total travel distance for every team over the course of the whole season. There have been many papers published on the subject, and a contest exists to find the best solutions for certain specific schedules. (en)
dbo:wikiPageID
  • 39776727 (xsd:integer)
dbo:wikiPageLength
  • 1354 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 921760744 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • The traveling tournament problem (TTP) is a mathematical optimization problem. The question involves scheduling a series of teams such that: 1. * Each team plays every other team twice, once at home and once in the other's stadium. 2. * No team plays the same opponent in two consecutive weeks. 3. * No team plays more than three games in a row at home, or three games in a row on the road. There have been many papers published on the subject, and a contest exists to find the best solutions for certain specific schedules. (en)
rdfs:label
  • Traveling tournament problem (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License