THE MAXIMUM CAPTURE OR “SPHERE OF INFLUENCE” LOCATION PROBLEM: HOTELLING REVISITED ON A NETWORK*

ABSTRACT. The problem of the ice cream vendor on the beach is extended to the siting of multiple entering servers into the midst of existing servers which are already in place at multiple sites on a network. The network of population nodes, joining arcs, and eligible sites for servers provides the underlying matrix of the problem. The goal of the single firm which is siting the multiple entering servers is the capture of the maximum population from existing servers. This combinatorial problem can be described as a linear integer program for which solutions can easily be derived. Computational experience and insights derived therefrom are reported.