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 this page instead for the normal view: A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem |
scientific article; zbMATH DE number 6816194
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
