While promoting a business or activity in geo-social networks, the geographical distance between its location and users is critical. Therefore, problem of Distance-Aware Influence Maximization (DAIM) has been investigated recently. The efficiency DAIM heavily relies on sample selection. Specifically, online seeding performance sensitive to promoted nearest location, offline precomputation numbe...

We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is then subdivided according to the nearest-neighbor rule, and the player whose points control the larger area wins. We present a winning strategy for the second player, where the arena is a circle or a l...

2

in this paper, we consider a special case of weber location problem which we call goal location problem. the weber location problem asks to find location of a point in the plane such that the sum of weighted distances between this point and n existing points is minimized. in the goal location problem each existing point pi has a relevant radius ri and it’s ideal for us to locate a new facility o...

We consider the bilevel uncapacitated facility location problem with user preferences. It is known that this model may be reformulated as a one-level location problem with some additional constraints. In this paper we introduce a new reformulation and show that this reformulation dominates three previous ones from the point of view of their linear programming relaxations and may be worse than a...