Solving mirrored traveling tournament problem benchmark instances with eight teams (Q924643)
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: Solving mirrored traveling tournament problem benchmark instances with eight teams |
scientific article; zbMATH DE number 5276158
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving mirrored traveling tournament problem benchmark instances with eight teams |
scientific article; zbMATH DE number 5276158 |
Statements
Solving mirrored traveling tournament problem benchmark instances with eight teams (English)
0 references
16 May 2008
0 references
traveling tournament
0 references
integer programming
0 references
one-factorization
0 references
sports scheduling
0 references
0 references
0 references
0.8005106449127197
0 references
0.7772519588470459
0 references
0.7721952199935913
0 references
0.7668002247810364
0 references
0.7632932066917419
0 references
