On the complexity of the traveling umpire problem (Q476848)
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: On the complexity of the traveling umpire problem |
scientific article; zbMATH DE number 6375971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the traveling umpire problem |
scientific article; zbMATH DE number 6375971 |
Statements
On the complexity of the traveling umpire problem (English)
0 references
2 December 2014
0 references
traveling umpire problem
0 references
computational complexity
0 references
sports scheduling
0 references
0 references
0.8483477830886841
0 references
0.8445050716400146
0 references
0.8406336307525635
0 references
0.8404472470283508
0 references
0.8316709399223328
0 references
