Traveling tournament problem

id: traveling-tournament-problem-316-10252836
title: Traveling tournament problem
text: The traveling tournament problem (TTP) is a mathematical optimization problem. The question involves scheduling a series of teams such that: Each team plays every other team twice, once at home and once in the other's stadium. No team plays the same opponent in two consecutive weeks. 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,
brand slug: wiki
category slug: encyclopedia
description:
original url: https://en.wikipedia.org/wiki/Traveling_tournament_problem
date created:
date modified: 2023-03-14T19:19:15Z
main entity: {"identifier":"Q16963647","url":"https://www.wikidata.org/entity/Q16963647"}
image:
fields total: 13
integrity: 13

Related Entries

Explore Next Part