A constrained sports scheduling problem (Q583097): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Sumit K. Garg / rank | |||
Normal rank | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Jacek Błażewicz / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4131934 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
coloring | |||
Property / zbMATH Keywords: coloring / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scheduling sport teams | |||
Property / zbMATH Keywords: scheduling sport teams / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
basketball | |||
Property / zbMATH Keywords: basketball / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
oriented factorizations | |||
Property / zbMATH Keywords: oriented factorizations / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
complete graphs | |||
Property / zbMATH Keywords: complete graphs / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: One-factorizations of the complete graph—A survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3659803 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A tournament problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling in Sports / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geography, games and graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the multiplication of divisions: The use of graphs for sports scheduling / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
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