Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1141728 | Discrete Optimization | 2014 | 16 Pages |
Abstract
We consider the variant of the tree p-median problem where each node must be connected to the two closest centers. This problem is polynomially solved through a dynamic programming formulation that extends the solution given by A. Tamir for the classicalp-median problem on a tree.
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
Philippe Chrétienne,