|
Diskretnyi Analiz i Issledovanie Operatsii, 2014, Volume 21, Issue 5, Pages 54–66
(Mi da793)
|
|
|
|
This article is cited in 9 scientific papers (total in 9 papers)
On complexity of bilevel problems of location and pricing
A. A. Paninab, A. V. Plyasunovab a S. L. Sobolev Institute of Mathematics, SB RAS, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia
Abstract:
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.
Received: 15.10.2013 Revised: 29.01.2014
Citation:
A. A. Panin, A. V. Plyasunov, “On complexity of bilevel problems of location and pricing”, Diskretn. Anal. Issled. Oper., 21:5 (2014), 54–66; J. Appl. Industr. Math., 8:4 (2014), 574–581
Linking options:
https://www.mathnet.ru/eng/da793 https://www.mathnet.ru/eng/da/v21/i5/p54
|
Statistics & downloads: |
Abstract page: | 324 | Full-text PDF : | 119 | References: | 57 | First page: | 15 |
|