RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

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


Diskretn. Anal. Issled. Oper., 2014, Volume 21, Number 4, Pages 62–79 (Mi da786)  

This article is cited in 2 scientific papers (total in 2 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

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.

Full text: PDF file (283 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2014, 8:4, 557–567

Bibliographic databases:

UDC: 519.87
Received: 18.03.2014
Revised: 24.05.2014

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://www.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:
  • http://mi.mathnet.ru/eng/da786
  • http://mi.mathnet.ru/eng/da/v21/i4/p62

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. S. V. Ivanov, M. V. Morozova, “Stochastic problem of competitive location of facilities with quantile criterion”, Autom. Remote Control, 77:3 (2016), 451–461  mathnet  crossref  isi  elib
    2. V. Beresnev, A. Melnikov, “Exact method for the capacitated competitive facility location problem”, Comput. Oper. Res., 95 (2018), 73–82  crossref  mathscinet  zmath  isi  scopus
  • Дискретный анализ и исследование операций
    Number of views:
    This page:215
    Full text:51
    References:24
    First page:8

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020