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

DOI10.1016/J.DISOPT.2014.06.001zbMATH Open1308.90087OpenAlexW1982164904MaRDI QIDQ2339828FDOQ2339828

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)

Cites Work

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

Cited In (2)

• Polyhedral properties of the \(K\)-median problem on a tree
• A polynomial method for the pos/neg weighted 3-median problem on a tree

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)