A polynomial algorithm for the two-connections variant of the tree p-median problem

DOI10.1016/J.DISOPT.2014.06.001MaRDI QIDQ2339828zbMATH OpenOpenAlexFDO

Authors Philippe Chrétienne

Publication date 9 April 2015

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2014.06.001

zbMATH Keywords

dynamic programminglocation\(p\)-median problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 2081038
• A polynomial algorithm for thep-centdian problem on a tree
• Algorithms – ESA 2005
• The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers
• scientific article; zbMATH DE number 4209907

Cites work

• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• Solution methods for thep-median problem: An annotated bibliography

Cited in

(4)

• A polynomial method for the pos/neg weighted 3-median problem on a tree
• Polyhedral properties of the \(K\)-median problem on a tree
• scientific article; zbMATH DE number 2081038 (Why is no real title available?)
• Algorithms – ESA 2005

This page was built for publication: A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem

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