Complexity results for the \(p\)-median problem with mutual communication
type: Item
instance of: scholarly article
title: Complexity results for the \(p\)-median problem with mutual communication
zbMATH Open document ID: 0792.90040
DOI: 10.1016/0167-6377(93)90099-3
author: Arie Tamir
published in: Operations Research Letters
publication date: 1994-07-25T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 527397
zbMATH Keywords: facility location
zbMATH Keywords: tree networks
zbMATH Keywords: \(p\)-median
zbMATH Keywords: mutual communication
zbMATH Keywords: undirected graph
MaRDI profile type: Publication
full work available at URL: 0167-6377(93)90099-3
OpenAlex ID: W2053975582
cites work: Locating facilities which interact: Some solvable cases
cites work: m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
cites work: Solving Structured Multifacility Location Problems Efficiently
cites work: Convex Location Problems on Tree Networks
cites work: A fast algorithm for the generalized parametric minimum cut problem and applications
cites work: A faster parametric minimum-cut algorithm
cites work: Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
cites work: Q3720256
cites work: Q4130999
cites work: A Cut Approach to the Rectilinear Distance Facility Location Problem
cites work: Effective algorithm for the weber problem with a rectangular metric
description: scientific article; zbMATH DE number 527397