| 块图上的p-maxian问题 |
| |
| 引用本文： | 程郁琨.块图上的p-maxian问题[J].芜湖职业技术学院学报,2009,11(1):8-11. |
| |
| 作者姓名： | 程郁琨 |
| |
| 作者单位： | 浙江财经学院数学与统计学院,浙江,杭州,310018 |
| |
| 基金项目： | 浙江财经学院校级科研项目 |
| |
| 摘 要： | p-maxian问题是在拥有n个demand点的网络中安置P个设施，使得所有demand点到最远设施的赋权距离之和达到最大。在本篇论文中，我们主要讨论在拥有正的顶点权重和单位边长的块图上限制p-maxian问题，并给出一个O（n）时间的算法。
|
| 关 键 词： | 选址问题 限制p-maxian问题 厌恶型选址 块图 |
The p-maxian problem on block graphs |
| |
| CHENG Yun-kun.The p-maxian problem on block graphs[J].Journal of Wuhu Vocational Institute of Technology,2009,11(1):8-11. |
| |
| Authors: | CHENG Yun-kun |
| |
| Institution: | CHENG Yun-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 vertex restricted p-maxian problem on block graphs with positive vertex weights and unit edge lengths. We present an O（n） time algorithm to solve the vertex restricted 2-maxian problem on weighted cycle. |
| |
| Keywords: | Location theory Vertex-restricted p-maxian problem Obnoxious facilities block graph |
| 本文献已被 维普 万方数据 等数据库收录！ |
