Complexity results for the p-median problem with mutual communication

Arie Tamir

doi:10.1016/0167-6377(93)90099-3

Complexity results for the p-median problem with mutual communication

Arie Tamir^*

^*Corresponding author for this work

School of Mathematical Sciences

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

3 Scopus citations

Abstract

The p-median problem with mutual communication is defined as follows: Let G = (V, E) be an undirected graph with positive edge lengths. Suppose that each node represents an existing facility. The objective is to locate p new facilities (medians) while minimizing the sum of weighted distances between all pairs of new facilities and pairs of new and existing facilities. We present new complexity results for this model and for some of its variants.

Original language	English
Pages (from-to)	79-84
Number of pages	6
Journal	Operations Research Letters
Volume	14
Issue number	2
DOIs	https://doi.org/10.1016/0167-6377(93)90099-3
State	Published - Sep 1993

Keywords

facility location
p-median
tree networks

Access to Document

10.1016/0167-6377(93)90099-3

Cite this

@article{23764dc7b94141c0bb3daf3a5b645f21,

title = "Complexity results for the p-median problem with mutual communication",

abstract = "The p-median problem with mutual communication is defined as follows: Let G = (V, E) be an undirected graph with positive edge lengths. Suppose that each node represents an existing facility. The objective is to locate p new facilities (medians) while minimizing the sum of weighted distances between all pairs of new facilities and pairs of new and existing facilities. We present new complexity results for this model and for some of its variants.",

keywords = "facility location, p-median, tree networks",

author = "Arie Tamir",

year = "1993",

month = sep,

doi = "10.1016/0167-6377(93)90099-3",

language = "אנגלית",

volume = "14",

pages = "79--84",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Complexity results for the p-median problem with mutual communication

AU - Tamir, Arie

PY - 1993/9

Y1 - 1993/9

N2 - The p-median problem with mutual communication is defined as follows: Let G = (V, E) be an undirected graph with positive edge lengths. Suppose that each node represents an existing facility. The objective is to locate p new facilities (medians) while minimizing the sum of weighted distances between all pairs of new facilities and pairs of new and existing facilities. We present new complexity results for this model and for some of its variants.

AB - The p-median problem with mutual communication is defined as follows: Let G = (V, E) be an undirected graph with positive edge lengths. Suppose that each node represents an existing facility. The objective is to locate p new facilities (medians) while minimizing the sum of weighted distances between all pairs of new facilities and pairs of new and existing facilities. We present new complexity results for this model and for some of its variants.

KW - facility location

KW - p-median

KW - tree networks

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

U2 - 10.1016/0167-6377(93)90099-3

DO - 10.1016/0167-6377(93)90099-3

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:38249002243

SN - 0167-6377

VL - 14

SP - 79

EP - 84

JO - Operations Research Letters

JF - Operations Research Letters

IS - 2

ER -

Complexity results for the p-median problem with mutual communication

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this