Location of Repository

A note on a stochastic location problem

By J.B.G. Frenk, M. Labbé and S. Zhang

Abstract

In this note we give a short and easy proof of the equivalence of Hakimi's one-median problem and the k-server-facility-loss median problem as discussed by Chiu and Larson in Computer and Operation Research. The proof makes only use of a stochastic monotonicity result for birth and death processes and the insensitivity of the M/G/k/k loss model.Hakimi median;stochastic location;stochastic monotonicity

OAI identifier:

Suggested articles

Preview


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.