A constrained sports scheduling problem (Q583097)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:583097 |
scientific article; zbMATH DE number 4131934
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A constrained sports scheduling problem |
scientific article; zbMATH DE number 4131934 |
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
0.8076031804084778
0 references
0.7995644807815552
0 references
0.7993083596229553
0 references
0.7958817481994629
0 references
0.7889363169670105
0 references
