A multi-round generalization of the traveling tournament problem and its application to Japanese baseball (Q421692): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2011.06.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002856610 / rank | |||
Normal rank | |||
Revision as of 03:05, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A multi-round generalization of the traveling tournament problem and its application to Japanese baseball |
scientific article |
Statements
A multi-round generalization of the traveling tournament problem and its application to Japanese baseball (English)
0 references
14 May 2012
0 references
scheduling
0 references
timetabling
0 references
graph theory
0 references
perfect matchings
0 references
one-factorization
0 references
traveling tournament problem
0 references
