Computational complexity of the discrete competitive facility location problem (Q5264752): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s1990478914040139 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974407940 / rank | |||
Normal rank | |||
Latest revision as of 10:29, 30 July 2024
scientific article; zbMATH DE number 6466109
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
