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, 2014, Volume 21, Issue 4, Pages 62–79 (Mi da786)  
This article is cited in 14 scientific papers (total in 14 papers)

Computational complexity of the discrete competitive facility location problem

A. A. Mel'nikovab

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
Full-text PDF (283 kB) Citations (14)
References:
PDF
HTML
Abstract: 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.
Received: 18.03.2014
Revised: 24.05.2014
English version:
Journal of Applied and Industrial Mathematics, 2014, Volume 8, Issue 4, Pages 557–567
DOI: https://doi.org/10.1134/S1990478914040139
Bibliographic databases:
Document Type: Article
UDC: 519.87
Language: Russian
Citation: A. A. Mel'nikov, “Computational complexity of the discrete competitive facility location problem”, Diskretn. Anal. Issled. Oper., 21:4 (2014), 62–79; J. Appl. Industr. Math., 8:4 (2014), 557–567
Citation in format AMSBIB
\Bibitem{Mel14}
\by A.~A.~Mel'nikov
\paper Computational complexity of the discrete competitive facility location problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2014
\vol 21
\issue 4
\pages 62--79
\mathnet{http://mi.mathnet.ru/da786}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3289222}
\transl
\jour J. Appl. Industr. Math.
\yr 2014
\vol 8
\issue 4
\pages 557--567
\crossref{https://doi.org/10.1134/S1990478914040139}
Linking options:
  • https://www.mathnet.ru/eng/da786
  • https://www.mathnet.ru/eng/da/v21/i4/p62
    • This publication is cited in the following 14 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025