Cut Generation Algorithm for the Discrete Competitive Facility Location Problem
V. L. Beresnev, Andrey A. Melnikov · Doklady Mathematics · 2018
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.