|
|||||
|
|
The general facility location problem with connectivity on trees |
|
| Authors: | Er Fang Shan Li Ying Kang |
| Institution: | 1. School of Management, Shanghai University, Shanghai 200444, P. R. China; 2. Department of Mathematics, Shanghai University, Shanghai 200444, P. R. China |
| Abstract: | In this note we study the general facility location problem with connectivity. We present an O(np 2)-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. |
| Keywords: | Connected p-center connected p-median tree equivalent binary tree |
| 本文献已被 CNKI SpringerLink 等数据库收录！ | |
| 点击此处可从《数学学报(英文版)》浏览原始摘要信息 | |
| 点击此处可从《数学学报(英文版)》下载免费的PDF全文 | |