m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
From MaRDI portal
Publication:3990564
DOI10.1287/opre.40.1.S56zbMath0761.90064MaRDI QIDQ3990564
Dilip Chhajed, Timothy J. Lowe
Publication date: 28 June 1992
Published in: Operations Research (Search for Journal in Brave)
polynomial time algorithmflow graphmutual communication\(m\)-median problemgraph theoretic node selection
Programming involving graphs or networks (90C35) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (7)
A distance constrained \(p\)-facility location problem on the real line ⋮ Information-theoretic feature selection with discrete \(k\)-median clustering ⋮ The hub location and routing problem ⋮ Locating facilities which interact: Some solvable cases ⋮ An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree ⋮ Minmax regret solutions for minimax optimization problems with uncertainty ⋮ Complexity results for the \(p\)-median problem with mutual communication
This page was built for publication: m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
