A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem (Q1683131)
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 6816194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem |
scientific article; zbMATH DE number 6816194 |
Statements
A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem (English)
0 references
6 December 2017
0 references
location
0 references
hub-and-spoke network
0 references
hub covering problem
0 references
tabu search
0 references
0 references
0 references
0.8437506556510925
0 references
0.8432502746582031
0 references
0.8381317853927612
0 references
0.8380936980247498
0 references
