Competitive facility location models

被引：12

作者：

Kononov, A. V. ^{[1
]}

Kochetov, Yu. A. ^{[1
]}

Plyasunov, A. V. ^{[1
]}

机构：

[1] Novosibirsk State Univ, Novosibirsk 630090, Russia

来源：

COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS | 2009年 / 49卷 / 06期

关键词：

location problems; local optima; Nash equilibriums; PLS complete problems; LOCAL SEARCH;

D O I：

10.1134/S0965542509060086

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页码：994 / 1009

页数：16