Parallel Complexity of Additive Location Problems
INFORMS Journal on Computing · 1999 · Volume 11 · Issue 3
Abstract
Parallel NC-algorithms for a general class of multifacility location problems on a tree with identical facilities and the minisum objective function are presented. The class includes the p-median problem, the p-coverage problem, and the uncapacitated plant location problem.
Keywords
complexity, optimization, algorithms, multifacility location, complexity, NC-algorithm
Enable JavaScript for citation tools and additional paper interactions.