# A note on a stochastic location problem

- Authors
- Source
- Legacy
- Disciplines

## 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.

## There are no comments yet on this publication. Be the first to share your thoughts.