Местоположение издательства:Road Town, United Kingdom
Первая страница:994
Последняя страница:1009
Аннотация: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.