A constrained sports scheduling problem (Q583097): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(90)90019-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044348108 / rank | |||
Normal rank | |||
Latest revision as of 08:23, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A constrained sports scheduling problem |
scientific article |
Statements
A constrained sports scheduling problem (English)
0 references
1990
0 references
The problem to be considered is one of scheduling sport teams for two basketball leagues. This problem differs from the classical sport scheduling problem by the existence of some additional resource constraints due to the common sport facilities. The authors solve the problem by using properties of oriented factorizations of complete graphs.
0 references
coloring
0 references
scheduling sport teams
0 references
basketball
0 references
oriented factorizations
0 references
complete graphs
0 references
