Asymptotically Optimal Service Station Arrangements for a Parametric Family of Criteria

Аннотация

This article presents a new effective algorithm for placing service stations. These stations serve the calls coming from a subset of the line. The coordinate of the call is a random variable with a known probability density function. This algorithm is proved to be asymptotically second-order optimal.