Reverse 1-median Problem with Constraint in Trees

摘要：

　　Different from classical location problem,the reverse problem is how to improve the network as efficient as possible within a given budget when the facilities have already been located in a network and cannot be moved to a new place.This paper concerns the reverse 1-meidan problem with constraint in tree network.It is shown that the model can be divided into two equivalent subproblems.The subproblems will be solved respectively by minimum cut algorithm and greedy algorithm.Finally,an example is set to verify the feasibility of these algorithms.

关键词： Facility location Tree network Reverse problem Minimum cut Greedy algorithm

作者: Yang Jianfang Jiang Juan

作者单位: Institute of Operational Research and Cybemetics, Hangzhou Dianzi University, Hangzhou 310018, China Institute of computer application,Hangzhou DianZi university,Hangzhou 310018,China

会议类型: 国际会议

会议名称: 2012 2nd International Conference on Computer Application and System Modeling(2012第二届计算机应用与系统建模国际会议)(ICCASM-2012)

会议地点: 沈阳

会议语种:英文

页码: 75-78

在线出版日期: 2012-07-27（万方平台首次上网日期，不代表论文的发表时间）