Complexity results for the \(p\)-median problem with mutual communication

DOI10.1016/0167-6377(93)90099-3zbMath0792.90040OpenAlexW2053975582MaRDI QIDQ1317006

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

facility locationundirected graphtree networks\(p\)-medianmutual communication

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Locating facilities which interact: Some solvable cases
• A fast algorithm for the generalized parametric minimum cut problem and applications
• A faster parametric minimum-cut algorithm
• Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
• Effective algorithm for the weber problem with a rectangular metric
• m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
• Convex Location Problems on Tree Networks
• A Cut Approach to the Rectilinear Distance Facility Location Problem
• Solving Structured Multifacility Location Problems Efficiently

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