Standard

Upper Bound for the Capacitated Competitive Facility Location Problem. / Beresnev, V. L.; Melnikov, A. A.

OPERATIONS RESEARCH PROCEEDINGS 2015. ред. / KF Doerner; Ljubic; G Pflug; G Tragler. Springer International Publishing AG, 2017. стр. 87-93 (Operations Research Proceedings).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Beresnev, VL & Melnikov, AA 2017, Upper Bound for the Capacitated Competitive Facility Location Problem. в KF Doerner, Ljubic, G Pflug & G Tragler (ред.), OPERATIONS RESEARCH PROCEEDINGS 2015. Operations Research Proceedings, Springer International Publishing AG, стр. 87-93, Operations Research Conference (OR), Vienna, Австрия, 01.09.2015. https://doi.org/10.1007/978-3-319-42902-1_12

APA

Beresnev, V. L., & Melnikov, A. A. (2017). Upper Bound for the Capacitated Competitive Facility Location Problem. в KF. Doerner, Ljubic, G. Pflug, & G. Tragler (Ред.), OPERATIONS RESEARCH PROCEEDINGS 2015 (стр. 87-93). (Operations Research Proceedings). Springer International Publishing AG. https://doi.org/10.1007/978-3-319-42902-1_12

Vancouver

Beresnev VL, Melnikov AA. Upper Bound for the Capacitated Competitive Facility Location Problem. в Doerner KF, Ljubic, Pflug G, Tragler G, Редакторы, OPERATIONS RESEARCH PROCEEDINGS 2015. Springer International Publishing AG. 2017. стр. 87-93. (Operations Research Proceedings). doi: 10.1007/978-3-319-42902-1_12

Author

Beresnev, V. L. ; Melnikov, A. A. / Upper Bound for the Capacitated Competitive Facility Location Problem. OPERATIONS RESEARCH PROCEEDINGS 2015. Редактор / KF Doerner ; Ljubic ; G Pflug ; G Tragler. Springer International Publishing AG, 2017. стр. 87-93 (Operations Research Proceedings).

BibTeX

@inproceedings{e33f2cac90554a54b11b480c0597d196,
title = "Upper Bound for the Capacitated Competitive Facility Location Problem",
abstract = "We consider the capacitated competitive facility location problem (CCFLP) where two competing firms open facilities to maximize their profits obtained from customer service. The decision making process is organized as a Stackelberg game. Both the set of candidate sites where firms may open facilities and the set of customers are finite. The customer demands are known, and the total demand covered by each of the facilities can not exceed its capacity. We propose the upper bound for the leader's objective function based on solving of the estimating MIP.",
author = "Beresnev, {V. L.} and Melnikov, {A. A.}",
year = "2017",
doi = "10.1007/978-3-319-42902-1_12",
language = "English",
isbn = "978-3-319-42901-4",
series = "Operations Research Proceedings",
publisher = "Springer International Publishing AG",
pages = "87--93",
editor = "KF Doerner and Ljubic and G Pflug and G Tragler",
booktitle = "OPERATIONS RESEARCH PROCEEDINGS 2015",
address = "Switzerland",
note = "Operations Research Conference (OR) ; Conference date: 01-09-2015 Through 04-09-2015",

}

RIS

TY - GEN

T1 - Upper Bound for the Capacitated Competitive Facility Location Problem

AU - Beresnev, V. L.

AU - Melnikov, A. A.

PY - 2017

Y1 - 2017

N2 - We consider the capacitated competitive facility location problem (CCFLP) where two competing firms open facilities to maximize their profits obtained from customer service. The decision making process is organized as a Stackelberg game. Both the set of candidate sites where firms may open facilities and the set of customers are finite. The customer demands are known, and the total demand covered by each of the facilities can not exceed its capacity. We propose the upper bound for the leader's objective function based on solving of the estimating MIP.

AB - We consider the capacitated competitive facility location problem (CCFLP) where two competing firms open facilities to maximize their profits obtained from customer service. The decision making process is organized as a Stackelberg game. Both the set of candidate sites where firms may open facilities and the set of customers are finite. The customer demands are known, and the total demand covered by each of the facilities can not exceed its capacity. We propose the upper bound for the leader's objective function based on solving of the estimating MIP.

U2 - 10.1007/978-3-319-42902-1_12

DO - 10.1007/978-3-319-42902-1_12

M3 - Conference contribution

SN - 978-3-319-42901-4

T3 - Operations Research Proceedings

SP - 87

EP - 93

BT - OPERATIONS RESEARCH PROCEEDINGS 2015

A2 - Doerner, KF

A2 - Ljubic, null

A2 - Pflug, G

A2 - Tragler, G

PB - Springer International Publishing AG

T2 - Operations Research Conference (OR)

Y2 - 1 September 2015 through 4 September 2015

ER -

ID: 25327232