Complexity of the unconstrained traveling tournament problem (Q1755839): 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.orl.2016.07.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2482644989 / rank | |||
Normal rank | |||
Revision as of 21:28, 19 March 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
