A polynomial algorithm for the p-centdian problem on a tree

Keyphrases

• Centdian 100%
• Center Problem 33%
• Convex Combination 33%
• K-median 33%
• Location Theory 33%
• Minimax 33%
• Minisum 33%
• Nearest Point 66%
• Network Position 33%
• P-median 33%
• P-median Problem 33%
• P-point 66%
• Perceptual Centers 66%
• Polynomial-time Algorithm 100%
• Real-world Problems 33%
• Tree Network 33%
• Weighted Distance 66%

Mathematics

• Center Point 50%
• Convex Combination 50%
• Median 100%
• Minimax 50%
• Minimizes 50%
• Objective Function 50%
• Polynomial 100%
• Polynomial Time 50%
• Tree Network 50%
• World Problems 50%