Complexity of the unconstrained traveling tournament problem (Q1755839)
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: Complexity of the unconstrained traveling tournament problem |
scientific article; zbMATH DE number 7000220
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the unconstrained traveling tournament problem |
scientific article; zbMATH DE number 7000220 |
Statements
Complexity of the unconstrained traveling tournament problem (English)
0 references
11 January 2019
0 references
scheduling
0 references
traveling tournament problem
0 references
NP-hard
0 references
0.9228207468986512
0 references
0.831541121006012
0 references
0.813531756401062
0 references
0.8110524415969849
0 references
0.8098990321159363
0 references
