Branch-and-bound algorithm for a competitive facility location problem Full article
| Journal |
Computers and Operations Research
ISSN: 0305-0548 , E-ISSN: 1873-765X |
||
|---|---|---|---|
| Output data | Year: 2013, Volume: 40, Pages: 2062-2070 Pages count : 9 DOI: 10.1016/j.cor.2013.02.023 | ||
| Tags | Bilevel programming problem; Branch-and-bound algorithm; Local search; Pseudo-Boolean function; Upper bound | ||
| Authors |
|
||
| Affiliations |
|
Abstract:
We study a mathematical model generalizing the well-known facility location problem. In this model
we consider two competing sides successively placing their facilities and aiming to ‘‘capture’’
consumers, in order to make maximal profit. We state the problem as a bilevel integer programming
problem, regarding optimal noncooperative solutions as optimal solutions. We propose a branch-andbound algorithm for finding the optimal noncooperative solution. While constructing the algorithm, we
represent our problem as the problem of maximizing a pseudo-Boolean function. An important
ingredient of the algorithm is a method for calculating an upper bound for the values of the pseudoBoolean function on subsets of solutions. We present the results of a simulation demonstrating the
computational capabilities of the proposed algorithm.
Cite:
Beresnev V.L.
Branch-and-bound algorithm for a competitive facility location problem
Computers and Operations Research. 2013. V.40. P.2062-2070. DOI: 10.1016/j.cor.2013.02.023 WOS Scopus OpenAlex
Branch-and-bound algorithm for a competitive facility location problem
Computers and Operations Research. 2013. V.40. P.2062-2070. DOI: 10.1016/j.cor.2013.02.023 WOS Scopus OpenAlex
Identifiers:
| Web of science: | WOS:000319491300014 |
| Scopus: | 2-s2.0-84876178984 |
| OpenAlex: | W2154477224 |