Email this article Asymptotically Optimal Service Station Arrangements for a Parametric Family of Criteria
- Authors: Fisak A.A.1, Zakharova T.V.1
-
Affiliations:
- Lomonosov Moscow State University
- Issue: Vol 237, No 6 (2019)
- Pages: 766-774
- Section: Article
- URL: https://journal-vniispk.ru/1072-3374/article/view/242449
- DOI: https://doi.org/10.1007/s10958-019-04202-3
- ID: 242449
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
A. A. Fisak
Lomonosov Moscow State University
Author for correspondence.
Email: toryinside@gmail.com
Russian Federation, Moscow
T. V. Zakharova
Lomonosov Moscow State University
Email: toryinside@gmail.com
Russian Federation, Moscow
Supplementary files
