The problem of locating p distinguishable facilities on a tree network with n nodes, subject to interfacility distance constraints, is considered. Each facility must be located within its own feasible region, that is selected in advance based on previous analysis. The main difference from the variants of the problem studied earlier is that more general feasible regions are allowed. A sequential
... [Show full abstract] location scheme for solving the problem is formulated, and sufficient conditions for the applicability of the scheme are presented. For the special case where the feasible regions are finite (sets of selected nodes of the tree), it is demonstrated that the sufficient conditions can be checked in O(pn) time; if they hold, the sequential location scheme can be implemented in O(np 2 ) time (for the case of finite feasible regions).