This article is cited in 2 scientific papers (total in 2 papers)
A capacitated competitive facility location problem
V. L. Beresnevab, A. A. Melnikovab
a Sobolev Institute of Mathematics, 4 Koptyug Ave., 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia
We consider a mathematical model relative to competitive location problems. In such problems, there are two competing sides which subsequently open their facilities aiming to “capture” clients and maximize profit. In our model, we assume that capacitiy of facilities are bounded. The model is formulated as a bi-level integer mathematical program and we study the problem of obtaining its optimal (cooperative) solution. It is shown that the problem can be reformulated as a problem of maximization of a pseudo-Boolean function with the number of arguments equal to the number of places available for facility opening. We propose an algorithm for calculation of an upper bound for values that the function takes on subsets which are specified by partial $(0,1)$-vectors. Bibl. 15.
bi-level programming, upper bound, competitive facility location.
PDF file (287 kB)
Journal of Applied and Industrial Mathematics, 2016, 10:1, 61–68
V. L. Beresnev, A. A. Melnikov, “A capacitated competitive facility location problem”, Diskretn. Anal. Issled. Oper., 23:1 (2016), 35–50; J. Appl. Industr. Math., 10:1 (2016), 61–68
Citation in format AMSBIB
\by V.~L.~Beresnev, A.~A.~Melnikov
\paper A capacitated competitive facility location problem
\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, “An upper bound for the competitive location and capacity choice problem with multiple demand scenarios”, J. Appl. Industr. Math., 11:4 (2017), 472–480
V. Beresnev, A. Melnikov, “Exact method for the capacitated competitive facility location problem”, Comput. Oper. Res., 95 (2018), 73–82
|Number of views:|