Cut Generation Algorithm for the Discrete Competitive Facility Location Problem
- 作者: Beresnev V.1,2, Melnikov A.1,2
-
隶属关系:
- Sobolev Institute of Mathematics, Siberian Branch
- Novosibirsk State University
- 期: 卷 97, 编号 3 (2018)
- 页面: 254-257
- 栏目: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225507
- DOI: https://doi.org/10.1134/S1064562418030183
- ID: 225507
如何引用文章
详细
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 optimal solution of the model under consideration is suggested.
作者简介
V. Beresnev
Sobolev Institute of Mathematics, Siberian Branch; Novosibirsk State University
编辑信件的主要联系方式.
Email: beresnev@math.nsc.ru
俄罗斯联邦, Novosibirsk, 630090; Novosibirsk, 630090
A. Melnikov
Sobolev Institute of Mathematics, Siberian Branch; Novosibirsk State University
Email: beresnev@math.nsc.ru
俄罗斯联邦, Novosibirsk, 630090; Novosibirsk, 630090