Conditional Minisum and Minimax Location-Allocation Problems in Euclidean Space

The problems of minimax and minisum location-allocation in two-dimensional Euclidean space, where some fixed service centers already exist in the area in question, are treated. The method utilized is an extension to a previously reported algorithm for the solution of the unconditional problem and yields good local minima. In the minisum problem this is at the moment the only feasible way to obtain any solutions. In the minimax case, a method for finding optimal solutions has been developed in parallel. However, the latter can yield results only to problems of limited size. A possible combination of the two methods is suggested.