Standard
Facility location in unfair competition. / Beresnev, Vladimir; Melnikov, Andrey.
Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Proceedings. ed. / Michael Khachay; Panos Pardalos; Yury Kochetov; Vladimir Beresnev; Evgeni Nurminski. Springer-Verlag GmbH and Co. KG, 2016. p. 325-335 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9869 LNCS).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Harvard
Beresnev, V & Melnikov, A 2016,
Facility location in unfair competition. in M Khachay, P Pardalos, Y Kochetov, V Beresnev & E Nurminski (eds),
Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9869 LNCS, Springer-Verlag GmbH and Co. KG, pp. 325-335, 9th International Conference on Discrete Optimization and Operations Research, DOOR 2016, Vladivostok, Russian Federation,
19.09.2016.
https://doi.org/10.1007/978-3-319-44914-2_26
APA
Beresnev, V., & Melnikov, A. (2016).
Facility location in unfair competition. In M. Khachay, P. Pardalos, Y. Kochetov, V. Beresnev, & E. Nurminski (Eds.),
Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Proceedings (pp. 325-335). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9869 LNCS). Springer-Verlag GmbH and Co. KG.
https://doi.org/10.1007/978-3-319-44914-2_26
Vancouver
Beresnev V, Melnikov A.
Facility location in unfair competition. In Khachay M, Pardalos P, Kochetov Y, Beresnev V, Nurminski E, editors, Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Proceedings. Springer-Verlag GmbH and Co. KG. 2016. p. 325-335. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-44914-2_26
Author
Beresnev, Vladimir ; Melnikov, Andrey. /
Facility location in unfair competition. Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Proceedings. editor / Michael Khachay ; Panos Pardalos ; Yury Kochetov ; Vladimir Beresnev ; Evgeni Nurminski. Springer-Verlag GmbH and Co. KG, 2016. pp. 325-335 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
BibTeX
@inproceedings{000695ad53e14a678d3a3d536453b372,
title = "Facility location in unfair competition",
abstract = "We consider a mathematical model belonging to the family of competitive location problems. In the model, there are two competing parties called Leader and Follower, which open their facilities with the goal to capture customers and maximize profit. In our model we assume that Follower is able to open own facilities as well as to close the Leader{\textquoteright}s ones. The model can be written as a pessimistic bilevel integer programming problem. We show that the problem of Leader{\textquoteright}s profit maximization can be represented as a problem of pseudo–Boolean function maximization. The number of variables the function depends on equals to the number of sites available for opening a facility. We suggest a method of calculation of an upper bound for the optimal value of the function based on strengthening of a bilevel model with valid inequalities and further relaxation of the model by removing the lower–level optimization problem.",
keywords = "Competitive location, Stackelberg game, Upper bound",
author = "Vladimir Beresnev and Andrey Melnikov",
year = "2016",
doi = "10.1007/978-3-319-44914-2_26",
language = "English",
isbn = "9783319449135",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "325--335",
editor = "Michael Khachay and Panos Pardalos and Yury Kochetov and Vladimir Beresnev and Evgeni Nurminski",
booktitle = "Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Proceedings",
address = "Germany",
note = "9th International Conference on Discrete Optimization and Operations Research, DOOR 2016 ; Conference date: 19-09-2016 Through 23-09-2016",
}
RIS
TY - GEN
T1 - Facility location in unfair competition
AU - Beresnev, Vladimir
AU - Melnikov, Andrey
PY - 2016
Y1 - 2016
N2 - We consider a mathematical model belonging to the family of competitive location problems. In the model, there are two competing parties called Leader and Follower, which open their facilities with the goal to capture customers and maximize profit. In our model we assume that Follower is able to open own facilities as well as to close the Leader’s ones. The model can be written as a pessimistic bilevel integer programming problem. We show that the problem of Leader’s profit maximization can be represented as a problem of pseudo–Boolean function maximization. The number of variables the function depends on equals to the number of sites available for opening a facility. We suggest a method of calculation of an upper bound for the optimal value of the function based on strengthening of a bilevel model with valid inequalities and further relaxation of the model by removing the lower–level optimization problem.
AB - We consider a mathematical model belonging to the family of competitive location problems. In the model, there are two competing parties called Leader and Follower, which open their facilities with the goal to capture customers and maximize profit. In our model we assume that Follower is able to open own facilities as well as to close the Leader’s ones. The model can be written as a pessimistic bilevel integer programming problem. We show that the problem of Leader’s profit maximization can be represented as a problem of pseudo–Boolean function maximization. The number of variables the function depends on equals to the number of sites available for opening a facility. We suggest a method of calculation of an upper bound for the optimal value of the function based on strengthening of a bilevel model with valid inequalities and further relaxation of the model by removing the lower–level optimization problem.
KW - Competitive location
KW - Stackelberg game
KW - Upper bound
UR - http://www.scopus.com/inward/record.url?scp=84988019725&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-44914-2_26
DO - 10.1007/978-3-319-44914-2_26
M3 - Conference contribution
AN - SCOPUS:84988019725
SN - 9783319449135
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 325
EP - 335
BT - Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Proceedings
A2 - Khachay, Michael
A2 - Pardalos, Panos
A2 - Kochetov, Yury
A2 - Beresnev, Vladimir
A2 - Nurminski, Evgeni
PB - Springer-Verlag GmbH and Co. KG
T2 - 9th International Conference on Discrete Optimization and Operations Research, DOOR 2016
Y2 - 19 September 2016 through 23 September 2016
ER -
