Cut Generation Algorithm for the Discrete Competitive Facility Location Problem | Sciact - Система учета научной деятельности ИМ СО РАН

Cut Generation Algorithm for the Discrete Competitive Facility Location Problem Научная публикация

Журнал

Doklady Mathematics
ISSN: 1064-5624 , E-ISSN: 1531-8362

Вых. Данные

Год: 2018, Том: 97, Номер: 3, Страницы: 254-257 Страниц : 4 DOI: 10.1134/s1064562418030183

Авторы

Beresnev V.L. ^1,2 , Melnikov A.A. ^1,2

Организации

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

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

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

Береснев В.Л. , Мельников А.А.
АЛГОРИТМ ГЕНЕРАЦИИ ОТСЕЧЕНИЙ ДЛЯ ДИСКРЕТНОЙ ЗАДАЧИ КОНКУРЕНТНОГО РАЗМЕЩЕНИЯ ПРЕДПРИЯТИЙ,
Доклады академии наук. 2018. Т.480. №5. С.515-518. DOI: 10.7868/s0869565218050018 OpenAlex

Web of science:	WOS:000438890200015
Scopus:	2-s2.0-85050075545
OpenAlex:	W2884999470

БД	Цитирований
Scopus	2
OpenAlex	3
Web of science	3