Tabu search approach for the bi-level competitive base station location problem (Q3133228)
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: Tabu search approach for the bi-level competitive base station location problem |
scientific article; zbMATH DE number 6837858
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tabu search approach for the bi-level competitive base station location problem |
scientific article; zbMATH DE number 6837858 |
Statements
Tabu Search Approach for the Bi-Level Competitive Base Station Location Problem (English)
0 references
13 February 2018
0 references
tabu search
0 references
bilevel programming
0 references
competitive location
0 references
0.9620499014854432
0 references
0.7876060009002686
0 references
0.7490435242652893
0 references
0.7419796586036682
0 references
