A meta-heuristic algorithm combining between tabu and variable neighborhood search for the minimum latency problem (Q4606261)
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: A meta-heuristic algorithm combining between tabu and variable neighborhood search for the minimum latency problem |
scientific article; zbMATH DE number 6846368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A meta-heuristic algorithm combining between tabu and variable neighborhood search for the minimum latency problem |
scientific article; zbMATH DE number 6846368 |
Statements
A Meta-Heuristic Algorithm Combining Between Tabu and Variable Neighborhood Search for the Minimum Latency Problem (English)
0 references
2 March 2018
0 references
minimum latency problem
0 references
tabu search
0 references
variable neighborhood search
0 references
0.8711506724357605
0 references
0.8534616827964783
0 references
0.77781742811203
0 references
0.7586498856544495
0 references
0.7563462853431702
0 references
