Complexity results for the p-median problem with mutual communication

DOI10.1016/0167-6377(93)90099-3MaRDI QIDQ1317006zbMATH OpenOpenAlexFDO

Authors Arie Tamir

Publication date 25 July 1994

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(93)90099-3

zbMATH Keywords

\(p\)-medianfacility locationmutual communicationtree networksundirected graph

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
• Median problems in networks
• On the (\(r|X_p\))-medianoid problem on a network with vertex and edge demands
• On the Complexity of Some Common Geometric Location Problems
• scientific article; zbMATH DE number 6288786

Cites work

• A Cut Approach to the Rectilinear Distance Facility Location Problem
• A fast algorithm for the generalized parametric minimum cut problem and applications
• A faster parametric minimum-cut algorithm
• Convex Location Problems on Tree Networks
• Effective algorithm for the weber problem with a rectangular metric
• Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
• scientific article; zbMATH DE number 3950165 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• Locating facilities which interact: Some solvable cases
• m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
• Solving Structured Multifacility Location Problems Efficiently

Cited in

(4)

• Complexity results for extensions of median orders to different types of remoteness
• m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
• Reviewing extensions and solution methods of the planar Weber single facility location problem
• Analyzing location models by the maximum possible value of perfect information

This page was built for publication: Complexity results for the \(p\)-median problem with mutual communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317006)