The General Facility Location Problem with Connectivity on Trees  

作　　者：Er Fang SHAN Li Ying KANG 

机构地区：[1]School of Management, Shanghai University, Shanghai 200444, P. R. China [2]Department of Mathematics, Shanghai University, Shanghai 200444, P. R. China

出　　处：《Acta Mathematica Sinica,English Series》2016年第9期1106-1112,共7页数学学报（英文版）

基　　金：Supported by National Nature Science Foundation of China(Grant Nos.11471210,11571222)

摘　　要：In this note we study the general facility location problem with connectivity. We present an O（np2）-time algorithm for the general facility location problem with connectivity on trees. Furthermore,we present an O（np）-time algorithm for the general facility location problem with connectivity on equivalent binary trees.In this note we study the general facility location problem with connectivity. We present an O（np2）-time algorithm for the general facility location problem with connectivity on trees. Furthermore,we present an O（np）-time algorithm for the general facility location problem with connectivity on equivalent binary trees.

关 键 词：Connected p-center connected p-median TREE equivalent binary tree 

分 类 号：O157.5[理学—数学] TP301.6[理学—基础数学]