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
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.
bi-level programming, optimal noncooperative solution, pseudo-Boolean function, branch-and-bound method.
PDF file (305 kB)
Journal of Applied and Industrial Mathematics, 2014, 8:2, 177–189
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
\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.
\jour J. Appl. Industr. Math.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
V. L. Beresnev, A. A. Melnikov, “A capacitated competitive facility location problem”, J. Appl. Industr. Math., 10:1 (2016), 61–68
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
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
V. Beresnev, A. Melnikov, “Exact method for the capacitated competitive facility location problem”, Comput. Oper. Res., 95 (2018), 73–82
V. L. Beresnev, A. A. Melnikov, “Cut generation algorithm for the discrete competitive facility location problem”, Dokl. Math., 97:3 (2018), 254–257
A. Rahmani, S. A. MirHassani, “An improved multi-parametric method for solving MIBLPP”, J. Inform. Optim. Science, 39:6 (2018), 1309–1328
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
|Number of views:|