• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: Traveling tournament problem     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:State100024720, within Data Space : dbpedia.org associated with source document(s)

Type: yago:WikicatMathematicalProblemsyago:Abstraction100002137yago:Attribute100024264yago:Condition113920835yago:Difficulty114408086yago:Problem114410605diseaseyago:State100024720 New Facet based on Instances of this Class

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.