A complete search method for the relaxed traveling tournament problem (Q2513735)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complete search method for the relaxed traveling tournament problem |
scientific article |
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
