A Linear Program for Points of Interest Relocation in Adaptive Maps.

The Point-Of-Interest (POI) relocation problem is a challenge encountered during the construction of personalized maps for given groups of users. This kind of maps was already studied and is known in the scientific literature under the name of “adaptive maps”. In this work, we formulate this problem as a subclass of the widely studied Distance Geometry Problem (DGP), where some extra constraints are included for taking into account the local orientation of the POIs in the map. These very same constraints allow us to linearize the problem, and hence to propose a novel linear program for the POI relocation problem. Our initial computational experiments indicate that our approach is promising for further investigations.