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 2, Pages 3–23 (Mi da763)  

This article is cited in 7 scientific papers (total in 7 papers)

Branch-and-bound method for the competitive facility location problem with prescribed choice of suppliers

V. L. Beresnevab, A. A. Melnikovba

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: The mathematical model is being considered, where two competing sides sequentially open their facilities with the goal to capture customers and maximize profit. The model can be written as the bi-level integer programming problem. Optimal noncooperative solutions are considered as optimal solutions of the problem. In order to provide appproximate and exact solutions of the problem the branch-and-bound method is proposed. Computational experiments show capability of the method to solve small and medium instances. Tab. 2, bibliogr. 18.

Keywords: bi-level programming, optimal noncooperative solution, pseudo-Boolean function, branch-and-bound method.

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

English version:
Journal of Applied and Industrial Mathematics, 2014, 8:2, 177–189

Bibliographic databases:

UDC: 519.87
Received: 04.07.2013
Revised: 15.10.2013

Citation: V. L. Beresnev, A. A. Melnikov, “Branch-and-bound method for the competitive facility location problem with prescribed choice of suppliers”, Diskretn. Anal. Issled. Oper., 21:2 (2014), 3–23; J. Appl. Industr. Math., 8:2 (2014), 177–189

Citation in format AMSBIB
\Bibitem{BerMel14}
\by V.~L.~Beresnev, A.~A.~Melnikov
\paper Branch-and-bound method for the competitive facility location problem with prescribed choice of suppliers
\jour Diskretn. Anal. Issled. Oper.
\yr 2014
\vol 21
\issue 2
\pages 3--23
\mathnet{http://mi.mathnet.ru/da763}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3241784}
\transl
\jour J. Appl. Industr. Math.
\yr 2014
\vol 8
\issue 2
\pages 177--189
\crossref{https://doi.org/10.1134/S1990478914020045}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84902178246}


Linking options:
  • http://mi.mathnet.ru/eng/da763
  • http://mi.mathnet.ru/eng/da/v21/i2/p3

    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. V. L. Beresnev, A. A. Melnikov, “A capacitated competitive facility location problem”, J. Appl. Industr. Math., 10:1 (2016), 61–68  mathnet  crossref  crossref  mathscinet  elib
    2. V. L. Beresnev, A. A. Melnikov, “Upper bound for the capacitated competitive facility location problem”, Operations Research Proceedings 2015, Operations Research Proceedings, eds. K. Doerner, I. Ljubic, G. Pflug, G. Tragler, Springler, 2017, 87–93  crossref  zmath  isi
    3. A. Rahmani, M. Yousefikhoshbakht, “An effective branch-and-cut algorithm in order to solve the mixed integer bi-level programming”, Int. J. Prod. Manag. Engineering, 5:1 (2017), 1–10  crossref  isi
    4. 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
    5. V. L. Beresnev, A. A. Melnikov, “Cut generation algorithm for the discrete competitive facility location problem”, Dokl. Math., 97:3 (2018), 254–257  mathnet  crossref  crossref  zmath  isi  scopus
    6. A. Rahmani, S. A. MirHassani, “An improved multi-parametric method for solving MIBLPP”, J. Inform. Optim. Science, 39:6 (2018), 1309–1328  crossref  mathscinet  isi
    7. V. L. Beresnev, A. A. Melnikov, “A cut generation algorithm of finding an optimal solution in a market competition”, J. Appl. Industr. Math., 13:2 (2019), 194–207  mathnet  crossref  crossref
  • Дискретный анализ и исследование операций
    Number of views:
    This page:339
    Full text:93
    References:46
    First page:43

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