We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which the travel speed is high. More specifically, one can travel from one endpoint of the walkway to the other at speed v > 1, but can only travel at unit speed between any other pair of points. The travel time between any...

We study a novel location optimization problem, the Collective-k Optimal Location Selection (CkOLS) problem. This problem finds k regions such that setting up k service sites, one in each region, collectively attracts the maximum number of customers by proximity. The problem generalizes the traditional influence maximizing location selection problem from searching for one optimal region to k re...