Cut Generation Algorithm for the Discrete Competitive Facility Location Problem

Research output: Contribution to journalArticlepeer-review

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 optimal solution of the model under consideration is suggested.

Original languageEnglish
Pages (from-to)254-257
Number of pages4
JournalDoklady Mathematics
Volume97
Issue number3
DOIs
Publication statusPublished - 1 May 2018

Fingerprint

Dive into the research topics of 'Cut Generation Algorithm for the Discrete Competitive Facility Location Problem'. Together they form a unique fingerprint.

Cite this