Complexity results for the p-median problem with mutual communication

Authors:
Arie Tamir
Affiliations:
Department of Statistics and Operations Research, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Ramat-Aviv, Tel Aviv 69978, Israel
Venue:
Operations Research Letters
Year:
1993

Citing 6
Cited 0

Efficient algorithms for optimization and selection on series-parallel graphs

SIAM Journal on Algebraic and Discrete Methods
Allocating Modules to Processors in a Distributed System

IEEE Transactions on Software Engineering
The complexity of multiway cuts (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
m-median and m-center problems with mutual communication: solvable special cases

Operations Research - Supplement
Locating facilities which interact: some solvable cases

Annals of Operations Research - Special issue on locational decisions
Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

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.