A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem (Q1683131): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2017.03.066 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2599976886 / rank | |||
Normal rank | |||
Revision as of 21:50, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem |
scientific article |
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
