Solving Structured Multifacility Location Problems Efficiently

A generic multifacility location problem is considered which subsumes, as special cases, several NP-hard location problems that have appeared in literature. A unified algorithm is presented which solves the generic problem in polynomial time when problem structure, as defined by interactions between pairs of facilities, satisfies certain properties.