An O(pn2) algorithm for the p-median and related problems on tree graphs

This publication has 9 references indexed in Scilit:

• On the location of a tree-shaped facility
  Networks, 1996
• Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints
  Operations Research, 1994
• Weightedk-cardinality trees: Complexity and polyhedral structure
  Networks, 1994
• The generalizedP-forest problem on a tree network
  Networks, 1992
• Improved complexity bounds for location problems on the real line
  Operations Research Letters, 1991
• The Maximum Coverage Location Problem
  SIAM Journal on Algebraic Discrete Methods, 1983
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
  Mathematics of Operations Research, 1983
• The distance-domination numbers of trees
  Operations Research Letters, 1982
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
  SIAM Journal on Applied Mathematics, 1979