On the ( r | X p ) -Medianoid Problem on a Network with Vertex and Edge Demands
Annals of Operations Research(2002)
摘要
This article considers the ( r | X p )-medianoid problem on a network N =( V , E ) with vertex and edge demands. There are already p facilities located on the network and customers patronize the closest facility. The aim is to locate r additional facilities on the network where their captured demands will be maximized. Relationships with the ( r | X p )-medianoid problem with vertex demands are established. Complexity and algorithmic results are presented.
更多查看译文
关键词
medianoid,competitive location
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络