Competitive Location on a Network

Gregory Dobson and Uday S. Karmarkar
Additional contact information
Gregory Dobson: University of Rochester, Rochester, New York
Uday S. Karmarkar: University of Rochester, Rochester, New York

Operations Research, 1987, vol. 35, issue 4, 565-574

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 (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (32)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.4.565 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:35:y:1987:i:4:p:565-574

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().