A dual algorithm for the weighted Euclidean distance min-max location problem in R2 and R3

A dual approach algorithm is given for the solution of the weighted minmax location problem with Euclidean distance in R2 and R3 . Each subproblem is solved using a directional search procedure and by taking advantage of its geometric structure. An algebraic replacement rule is employed to update the subproblem.