Competitive Location on a Network
Gregory Dobson, Uday S. Karmarkar
Operations Research · 1987 · Volume 35 · Issue 4
Abstract
In this paper we study the problem of locating facilities on a network in the presence of competition. Customers at each node in the network choose from the available facilities so as to minimize the distance traveled. The problem is to find a set of facilities that is stable in the sense that each facility is economically viable and no competitor can successfully open any facilities. We define several versions of stability and establish certain relationships between them. We then present integer programming formulations that identify stable sets, and describe an enumeration algorithm for constructing a profit-maximizing stable set.
Keywords
185 competitive location, 308 retail location, 637 location formulations
Enable JavaScript for citation tools and additional paper interactions.