An improved scheduling algorithm for traveling tournament problem with maximum trip length two (Q6587294)
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: An improved scheduling algorithm for traveling tournament problem with maximum trip length two |
scientific article; zbMATH DE number 7896708
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved scheduling algorithm for traveling tournament problem with maximum trip length two |
scientific article; zbMATH DE number 7896708 |
Statements
An improved scheduling algorithm for traveling tournament problem with maximum trip length two (English)
0 references
13 August 2024
0 references
traveling tournament problem
0 references
double round-Robin
0 references
scheduling
0 references
approximation
0 references
0.9076159000396729
0 references
0.8696442246437073
0 references
0.8533148169517517
0 references
0.8530860543251038
0 references
0.8491358160972595
0 references
