Complexity results for the p-median problem with mutual communication

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)79-84
Number of pages6
JournalOperations Research Letters
Volume14
Issue number2
DOIs
StatePublished - Sep 1993

Keywords

  • facility location
  • p-median
  • tree networks

Fingerprint

Dive into the research topics of 'Complexity results for the p-median problem with mutual communication'. Together they form a unique fingerprint.

Cite this