Cut Generation Algorithm for the Discrete Competitive Facility Location Problem Full article
| Journal |
Doklady Mathematics
ISSN: 1064-5624 , E-ISSN: 1531-8362 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2018, Volume: 97, Number: 3, Pages: 254-257 Pages count : 4 DOI: 10.1134/s1064562418030183 | ||||
| Authors |
|
||||
| Affiliations |
|
Abstract:
A competitive facility location model formulated as a bilevel programming problem is considered.
A new approach to the construction of estimating problems for bilevel competitive location models is proposed. An iterative algorithm for solving a series of mixed integer programming problems to obtain a pessimistic optima
Cite:
Beresnev V.L.
, Melnikov A.A.
Cut Generation Algorithm for the Discrete Competitive Facility Location Problem
Doklady Mathematics. 2018. V.97. N3. P.254-257. DOI: 10.1134/s1064562418030183 WOS Scopus OpenAlex
Cut Generation Algorithm for the Discrete Competitive Facility Location Problem
Doklady Mathematics. 2018. V.97. N3. P.254-257. DOI: 10.1134/s1064562418030183 WOS Scopus OpenAlex
Original:
Береснев В.Л.
, Мельников А.А.
АЛГОРИТМ ГЕНЕРАЦИИ ОТСЕЧЕНИЙ ДЛЯ ДИСКРЕТНОЙ ЗАДАЧИ КОНКУРЕНТНОГО РАЗМЕЩЕНИЯ ПРЕДПРИЯТИЙ,
Доклады академии наук. 2018. Т.480. №5. С.515-518. DOI: 10.7868/s0869565218050018 OpenAlex
АЛГОРИТМ ГЕНЕРАЦИИ ОТСЕЧЕНИЙ ДЛЯ ДИСКРЕТНОЙ ЗАДАЧИ КОНКУРЕНТНОГО РАЗМЕЩЕНИЯ ПРЕДПРИЯТИЙ,
Доклады академии наук. 2018. Т.480. №5. С.515-518. DOI: 10.7868/s0869565218050018 OpenAlex
Identifiers:
| Web of science: | WOS:000438890200015 |
| Scopus: | 2-s2.0-85050075545 |
| OpenAlex: | W2884999470 |