|
|||||
|
|
On the ( r | X p )-Medianoid Problem on a Network with Vertex and Edge Demands |
|
| Authors: | Abdullah Dasci HA Eiselt Gilbert Laporte |
| Institution: | (1) Canada Research Chair in Distribution Management, École des Hautes Études Commerciales de Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada, H3T 2A7;(2) Faculty of Administration, University of New Brunswick, Fredericton, New Brunswick, Canada, E3B 5A3;(3) Canada Research Chair in Distribution Management and GERAD, École des Hautes Études Commerciales de Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada, H3T 2A7 |
| Abstract: | 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. |
| Keywords: | medianoid competitive location |
| 本文献已被 SpringerLink 等数据库收录！ | |