Geodesic
Computational complexity of the discrete competitive facility location problem
Diskretnyj analiz i issledovanie operacij, Tome 21 (2014) no. 4, pp. 62-79

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider the discrete competitive facility location problem where a finite set of clients and a finite set of candidate sites are given. Two competing firms successively open their facilities with the goal to maximize the profit from serving the clients. Each client chooses only one facility to be served by according to his known preferences. We determine the computational complexity of the problem in two special cases. Bibliogr. 16.
Keywords: polynomial hierarchy, Stackelberg game, bilevel programming. 
@article{DA_2014_21_4_a6,
     author = {A. A. Mel'nikov},
     title = {Computational complexity of the discrete competitive facility location problem},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {62--79},
     publisher = {mathdoc},
     volume = {21},
     number = {4},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2014_21_4_a6/}
}
TY  - JOUR
AU  - A. A. Mel'nikov
TI  - Computational complexity of the discrete competitive facility location problem
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2014
SP  - 62
EP  - 79
VL  - 21
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2014_21_4_a6/
LA  - ru
ID  - DA_2014_21_4_a6
ER  - 
%0 Journal Article
%A A. A. Mel'nikov
%T Computational complexity of the discrete competitive facility location problem
%J Diskretnyj analiz i issledovanie operacij
%D 2014
%P 62-79
%V 21
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2014_21_4_a6/
%G ru
%F DA_2014_21_4_a6
A. A. Mel'nikov. Computational complexity of the discrete competitive facility location problem. Diskretnyj analiz i issledovanie operacij, Tome 21 (2014) no. 4, pp. 62-79. http://geodesic.mathdoc.fr/item/DA_2014_21_4_a6/