| 赋权圈上的2-maxian问题 |
| |
| 引用本文： | 程郁琨. 赋权圈上的2-maxian问题[J]. 芜湖职业技术学院学报, 2008, 10(4): 1-5 |
| |
| 作者姓名： | 程郁琨 |
| |
| 作者单位： | 浙江财经学院数学与统计学院,浙江杭州,310018 |
| |
| 摘 要： | p-maxian问题是在拥有n个demand点的网络中安置p个设施，使得所有demand点到最远设施的赋权距离之和达到最大。在本篇论文中，我们主要讨论在赋权圈上限制的2．maxian问题，并给出O（n^2）时间的算法。
|
| 关 键 词： | 选址问题 限制的2-maxian问题 厌恶型选址 圈 |
The 2-maxian problem on weighted cycles |
| |
| Cheng Yu-kun. The 2-maxian problem on weighted cycles[J]. Journal of Wuhu Vocational Institute of Technology, 2008, 10(4): 1-5 |
| |
| Authors: | Cheng Yu-kun |
| |
| Affiliation: | Cheng Yu-kun |
| |
| Abstract: | The p-maxian problem is to locate p facilities in a network of n demand points so as to maximize the sum of weighted distance from all clients to the farthest facility. In this paper we study the 2-maxian problem on cactus graphs. We present an O ( n 2)time algorithm to solve the vertex restricted 2-maxian problem on weighted cycle. |
| |
| Keywords: | Location theory Vertex-restricted 2-maxian problem Obnoxious facilities Cycle. |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
