Complexity of the unconstrained traveling tournament problem (Q1755839): Difference between revisions
From MaRDI portal
Latest revision as of 08:32, 11 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity of the unconstrained traveling tournament problem |
scientific article |
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