Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2012, Volume 19, Issue 6, Pages 56–71 (Mi da712)  
This article is cited in 16 scientific papers (total in 16 papers)

The pricing problem. Part 2. The computational complexity

A. V. Plyasunovab, A. A. Paninba

a Novosibirsk State University, Novosibirsk, Russia
b Sobolev Institute of Mathematics, Novosibirsk, Russia
Full-text PDF (302 kB) Citations (16)
References:
PDF
HTML
Abstract: For the problem, it is shown that it belongs to the class Log-APX, cannot be approximable with an absolute error limited by a constant, and the corresponding evaluation problem is non-trivial in the class $\Delta^p_2$. Also, two polynomial solvable cases of the problem are provided. Bibliogr. 8.
Keywords: computational complexity, approximability, the bilevel pricing problem, approximate algorithm, approximability class, NP-hard in the strong sense, polynomial hierarchy.
Received: 01.06.2011
Revised: 04.06.2012
English version:
Journal of Applied and Industrial Mathematics, 2013, Volume 7, Issue 3, Pages 420–430
DOI: https://doi.org/10.1134/S1990478913030150
Bibliographic databases:
Document Type: Article
UDC: 519.87+519.854
Language: Russian
Citation: A. V. Plyasunov, A. A. Panin, “The pricing problem. Part 2. The computational complexity”, Diskretn. Anal. Issled. Oper., 19:6 (2012), 56–71; J. Appl. Industr. Math., 7:3 (2013), 420–430
Citation in format AMSBIB
\Bibitem{PlyPan12}
\by A.~V.~Plyasunov, A.~A.~Panin
\paper The pricing problem. Part~2. The computational complexity
\jour Diskretn. Anal. Issled. Oper.
\yr 2012
\vol 19
\issue 6
\pages 56--71
\mathnet{http://mi.mathnet.ru/da712}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3076914}
\transl
\jour J. Appl. Industr. Math.
\yr 2013
\vol 7
\issue 3
\pages 420--430
\crossref{https://doi.org/10.1134/S1990478913030150}
Linking options:
  • https://www.mathnet.ru/eng/da712
  • https://www.mathnet.ru/eng/da/v19/i6/p56
    Cycle of papers
    This publication is cited in the following 16 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:364
    Full-text PDF :128
    References:34
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024