Competitive facility location models Full article
Journal |
Computational Mathematics and Mathematical Physics
ISSN: 0965-5425 , E-ISSN: 1555-6662 |
||
---|---|---|---|
Output data | Year: 2009, Volume: 49, Number: 6, Pages: 994–1009 Pages count : | ||
Authors |
|
||
Affiliations |
|
Abstract:
Two classes of competitive facility location models are considered, in which several persons (players) sequentially or simultaneously open facilities for serving clients. The first class consists of discrete two-level programming models. The second class consists of game models with several independent players pursuing selfish goals. For the first class, its relationship with pseudo-Boolean functions is established and a novel method for constructing a family of upper and lower bounds on the optimum is proposed. For the second class, the tight PLS-completeness of the problem of finding Nash equilibriums is proved.
Cite:
Kononov A.V.
, Кочетов Ю.А.
, Плясунов А.В.
Competitive facility location models
Computational Mathematics and Mathematical Physics. 2009. V.49. N6. P.994–1009.
Competitive facility location models
Computational Mathematics and Mathematical Physics. 2009. V.49. N6. P.994–1009.
Original:
Кононов А.В.
, Кочетов Ю.А.
, Плясунов А.В.
Конкурентные модели размещения производства
Журнал вычислительной математики и математической физики. 2009. Т.49. №6. С.1037–1054.
Конкурентные модели размещения производства
Журнал вычислительной математики и математической физики. 2009. Т.49. №6. С.1037–1054.
Dates:
Submitted: | Feb 29, 2008 |
Accepted: | Aug 11, 2008 |
Published online: | Jun 19, 2009 |
Identifiers:
No identifiers
Citing:
Пока нет цитирований