In this paper a minimax location problem in the plane is described where it is the objective to minimize the largest flow at any point in the plane. Solution techniques for a continuous and a discrete version of the problem are developed and computational experience is reported. Some extensions of the problems are also discussed.