Geodesic
On complexity of bilevel problems of location and pricing
Diskretnyj analiz i issledovanie operacij, Tome 21 (2014) no. 5, pp. 54-66

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

We study complexity of bilevel problems with different pricing strategies: uniform, mill and discriminatory. It is shown that these problems are NP-hard in the strong sense, belong to Poly-APX class and are complete in its relative AP-reducibility. Bibliogr. 17.
Keywords: bilevel problem, location, pricing, computational and approximation complexity, NP-hard in the strong sense, AP-reducibility, Poly-APX-completeness. 
@article{DA_2014_21_5_a4,
     author = {A. A. Panin and A. V. Plyasunov},
     title = {On complexity of bilevel problems of location and pricing},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {54--66},
     publisher = {mathdoc},
     volume = {21},
     number = {5},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2014_21_5_a4/}
}
TY  - JOUR
AU  - A. A. Panin
AU  - A. V. Plyasunov
TI  - On complexity of bilevel problems of location and pricing
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2014
SP  - 54
EP  - 66
VL  - 21
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2014_21_5_a4/
LA  - ru
ID  - DA_2014_21_5_a4
ER  - 
%0 Journal Article
%A A. A. Panin
%A A. V. Plyasunov
%T On complexity of bilevel problems of location and pricing
%J Diskretnyj analiz i issledovanie operacij
%D 2014
%P 54-66
%V 21
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2014_21_5_a4/
%G ru
%F DA_2014_21_5_a4
A. A. Panin; A. V. Plyasunov. On complexity of bilevel problems of location and pricing. Diskretnyj analiz i issledovanie operacij, Tome 21 (2014) no. 5, pp. 54-66. http://geodesic.mathdoc.fr/item/DA_2014_21_5_a4/