Computational complexity of the discrete competitive facility location problem (Q5264752)
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 6466109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of the discrete competitive facility location problem |
scientific article; zbMATH DE number 6466109 |
Statements
Computational complexity of the discrete competitive facility location problem (English)
0 references
27 July 2015
0 references
polynomial hierarchy
0 references
Stackelberg game
0 references
bilevel programming
0 references
0 references
0.8260234594345093
0 references
0.8136839866638184
0 references
0.8122303485870361
0 references
0.8076081275939941
0 references
