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 2, Pages 3–23 (Mi da763)  
This article is cited in 15 scientific papers (total in 15 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
Full-text PDF (305 kB) Citations (15)
References:
PDF
HTML
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.
Received: 04.07.2013
Revised: 15.10.2013
English version:
Journal of Applied and Industrial Mathematics, 2014, Volume 8, Issue 2, Pages 177–189
DOI: https://doi.org/10.1134/S1990478914020045
Bibliographic databases:
Document Type: Article
UDC: 519.87
Language: Russian
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://mathscinet.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{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84902178246}
Linking options:
  • https://www.mathnet.ru/eng/da763
  • https://www.mathnet.ru/eng/da/v21/i2/p3
    • This publication is cited in the following 15 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:516
    Full-text PDF :207
    References:81
    First page:43
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024