A Subgradient Procedure for the Solution of Minimax Location Problems.

摘要

A heuristic subgradient algorithm is presented for the solution of minimax location problems involving Euclidean and rectilinear distances. An attractive feature is the ease of implementation. Computational comparison with existing methods shows up to 90% savings in computer time. (Author)