SUPPLY CENTERS ALLOCATION UNDER BUDGET RESTRICTIONS MINIMIZING THE LONGEST DELIVERY TIME

Let G = (V, E) be a connected directed graph expressing a distribution network. The elements of D subset-or-equal-to V represent demand cent ers, while S subset-or-equal-to V contains the candidate supply center s. To each node x is-an-element-of S, we associate a weight w(x) which corresponds to the cost of installing a supply center at node x. To e very arc (x, y) is-an-element-of E we associate a weight a(x, y) which indicates the required time to reach node y directly from node x. The purpose of this paper is the determination of the subsets of S under a given budget restriction, so to minimize the longest delivery time o f facilities to the demand nodes of D.