A note on a stochastic location problem

J. B G Frenk; M. Labbé; S. Zhang

doi:10.1016/0167-6377(93)90042-F

A note on a stochastic location problem

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

Industrial and Systems Engineering

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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.

Original language	English (US)
Pages (from-to)	213-214
Number of pages	2
Journal	Operations Research Letters
Volume	13
Issue number	4
DOIs	https://doi.org/10.1016/0167-6377(93)90042-F
State	Published - May 1993

Keywords

Hakimi median
stochastic location
stochastic monotonicity

Publisher link

10.1016/0167-6377(93)90042-F

Find It

Find It at U of M Libraries

Cite this

@article{5cba9d8bd1ce4771ba4cddf0ccd8de30,

title = "A note on a stochastic location problem",

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.",

keywords = "Hakimi median, stochastic location, stochastic monotonicity",

author = "Frenk, {J. B G} and M. Labb{\'e} and S. Zhang",

year = "1993",

month = may,

doi = "10.1016/0167-6377(93)90042-F",

language = "English (US)",

volume = "13",

pages = "213--214",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

T1 - A note on a stochastic location problem

AU - Frenk, J. B G

AU - Labbé, M.

AU - Zhang, S.

PY - 1993/5

Y1 - 1993/5

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

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

KW - Hakimi median

KW - stochastic location

KW - stochastic monotonicity

UR - http://www.scopus.com/inward/record.url?scp=38249003787&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38249003787&partnerID=8YFLogxK

U2 - 10.1016/0167-6377(93)90042-F

DO - 10.1016/0167-6377(93)90042-F

M3 - Article

AN - SCOPUS:38249003787

SN - 0167-6377

VL - 13

SP - 213

EP - 214

JO - Operations Research Letters

JF - Operations Research Letters

IS - 4

ER -

A note on a stochastic location problem

Abstract

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this