Abstract
Previous studies of one-facility minimax location problems are extended by permitting the cost of travel to be given by any (strictly) increasing, continuous function of travel distance. Previous solution procedures for the rectilinear distance problem in the plane and for the problem on a tree network are extended to these general cost functions.

This publication has 0 references indexed in Scilit: