Optimal Positioning of Service Stations


Citar

Texto integral

Acesso aberto Acesso aberto
Acesso é fechado Acesso está concedido
Acesso é fechado Somente assinantes

Resumo

An effective new algorithm is presented for positioning service stations for calls which come from a subset of the line. The coordinate of a call is a random quantity which has a distribution density with compact support. The asymptotic second order optimality of this algorithm is found. A necessary optimality condition of positioning stations for a family of optimality criteria is also found.

Sobre autores

T. Zakharova

Faculty of Computational Mathematics and Cybernetics; Institute of Informatics Problems

Autor responsável pela correspondência
Email: zvzaharova@mail.ru
Rússia, Moscow, 119991; Moscow, 119333

А. Fisak

Faculty of Computational Mathematics and Cybernetics

Email: zvzaharova@mail.ru
Rússia, Moscow, 119991

Arquivos suplementares

Arquivos suplementares
Ação
1. JATS XML

Declaração de direitos autorais © Allerton Press, Inc., 2018