Standard

Cut Generation Algorithm for the Discrete Competitive Facility Location Problem. / Beresnev, V. L.; Melnikov, A. A.

In: Doklady Mathematics, Vol. 97, No. 3, 01.05.2018, p. 254-257.

Research output: Contribution to journal › Article › peer-review

Harvard

Beresnev, VL & Melnikov, AA 2018, 'Cut Generation Algorithm for the Discrete Competitive Facility Location Problem', Doklady Mathematics, vol. 97, no. 3, pp. 254-257. https://doi.org/10.1134/S1064562418030183

APA

Beresnev, V. L., & Melnikov, A. A. (2018). Cut Generation Algorithm for the Discrete Competitive Facility Location Problem. Doklady Mathematics, 97(3), 254-257. https://doi.org/10.1134/S1064562418030183

Vancouver

Beresnev VL, Melnikov AA. Cut Generation Algorithm for the Discrete Competitive Facility Location Problem. Doklady Mathematics. 2018 May 1;97(3):254-257. doi: 10.1134/S1064562418030183

Author

Beresnev, V. L. ; Melnikov, A. A. / Cut Generation Algorithm for the Discrete Competitive Facility Location Problem. In: Doklady Mathematics. 2018 ; Vol. 97, No. 3. pp. 254-257.

BibTeX

@article{0ab0c36941264b4f9dfe997b7733eca9,
title = "Cut Generation Algorithm for the Discrete Competitive Facility Location Problem",
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.",
author = "Beresnev, {V. L.} and Melnikov, {A. A.}",
year = "2018",
month = may,
day = "1",
doi = "10.1134/S1064562418030183",
language = "English",
volume = "97",
pages = "254--257",
journal = "Doklady Mathematics",
issn = "1064-5624",
publisher = "Maik Nauka-Interperiodica Publishing",
number = "3",

}

RIS

TY - JOUR

T1 - Cut Generation Algorithm for the Discrete Competitive Facility Location Problem

AU - Beresnev, V. L.

AU - Melnikov, A. A.

PY - 2018/5/1

Y1 - 2018/5/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85050075545&partnerID=8YFLogxK

U2 - 10.1134/S1064562418030183

DO - 10.1134/S1064562418030183

M3 - Article

AN - SCOPUS:85050075545

VL - 97

SP - 254

EP - 257

JO - Doklady Mathematics

JF - Doklady Mathematics

SN - 1064-5624

IS - 3

ER -

ID: 15965892