Standard

Upper bound for the competitive facility location problem with quantile criterion. / Melnikov, Andrey; Beresnev, Vladimir.

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. 373-387 (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

Melnikov, A & Beresnev, V 2016, Upper bound for the competitive facility location problem with quantile criterion. 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. 373-387, 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_30

APA

Melnikov, A., & Beresnev, V. (2016). Upper bound for the competitive facility location problem with quantile criterion. In M. Khachay, P. Pardalos, Y. Kochetov, V. Beresnev, & E. Nurminski (Eds.), Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Proceedings (pp. 373-387). (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_30

Vancouver

Melnikov A, Beresnev V. Upper bound for the competitive facility location problem with quantile criterion. 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. 373-387. (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_30

Author

Melnikov, Andrey ; Beresnev, Vladimir. / Upper bound for the competitive facility location problem with quantile criterion. 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. 373-387 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{51c126dc5452462e8ec70949612f3bd6,
title = "Upper bound for the competitive facility location problem with quantile criterion",
abstract = "In this paper, we consider a competitive location problem in a form of Stackelberg game. Two parties open facilities with the goal to capture customers and maximize own profits. One of the parties, called Leader, opens facilities first. The set of customers is specified after Leader{\textquoteright}s turn with random realization of one of possible scenarios. Leader{\textquoteright}s goal is to maximize the profit guaranteed with given probability or reliability level provided that the second party, called Follower, acts rationally in each of the scenarios. We suggest an estimating problem to obtain an upper bound for Leader{\textquoteright}s objective function and compare the performance of estimating problem reformulations experimentally.",
keywords = "Competitive location, Reformulation, Stackelberg game, Upper bound",
author = "Andrey Melnikov and Vladimir Beresnev",
year = "2016",
doi = "10.1007/978-3-319-44914-2_30",
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 = "373--387",
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 - Upper bound for the competitive facility location problem with quantile criterion

AU - Melnikov, Andrey

AU - Beresnev, Vladimir

PY - 2016

Y1 - 2016

N2 - In this paper, we consider a competitive location problem in a form of Stackelberg game. Two parties open facilities with the goal to capture customers and maximize own profits. One of the parties, called Leader, opens facilities first. The set of customers is specified after Leader’s turn with random realization of one of possible scenarios. Leader’s goal is to maximize the profit guaranteed with given probability or reliability level provided that the second party, called Follower, acts rationally in each of the scenarios. We suggest an estimating problem to obtain an upper bound for Leader’s objective function and compare the performance of estimating problem reformulations experimentally.

AB - In this paper, we consider a competitive location problem in a form of Stackelberg game. Two parties open facilities with the goal to capture customers and maximize own profits. One of the parties, called Leader, opens facilities first. The set of customers is specified after Leader’s turn with random realization of one of possible scenarios. Leader’s goal is to maximize the profit guaranteed with given probability or reliability level provided that the second party, called Follower, acts rationally in each of the scenarios. We suggest an estimating problem to obtain an upper bound for Leader’s objective function and compare the performance of estimating problem reformulations experimentally.

KW - Competitive location

KW - Reformulation

KW - Stackelberg game

KW - Upper bound

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

U2 - 10.1007/978-3-319-44914-2_30

DO - 10.1007/978-3-319-44914-2_30

M3 - Conference contribution

AN - SCOPUS:84988028749

SN - 9783319449135

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 373

EP - 387

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 -

ID: 25326973