You are not currently logged in.
Access JSTOR through your library or other institution:
Competitive Location on a Network
Gregory Dobson and Uday S. Karmarkar
Vol. 35, No. 4 (Jul. - Aug., 1987), pp. 565-574
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/170502
Page Count: 10
You can always find the topics here!Topics: Perceptual localization, Viability, Vertices, Demand, Algorithms, Travel expenses, Geodetic position, Customers, Integers, Prices
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
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.
Operations Research © 1987 INFORMS