A complete search method for the relaxed traveling tournament problem (Q2513735)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6391952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complete search method for the relaxed traveling tournament problem |
scientific article; zbMATH DE number 6391952 |
Statements
A complete search method for the relaxed traveling tournament problem (English)
0 references
28 January 2015
0 references
traveling tournament problem
0 references
branch-and-bound
0 references
metaheuristics
0 references
dynamic programming
0 references
0.798563539981842
0 references
0.7964056730270386
0 references
0.7817140817642212
0 references
