Reverse center location problem
文献类型：期刊论文
| 作者 | Zhang, JZ; Yang, XG; Cai, MC |
| 刊名 | ALGORITHMS AND COMPUTATIONS
 |
| 出版日期 | 2000 |
| 卷号 | 1741页码:279-294 |
| 关键词 | networks and graphs NP-hard satisfiability problem relaxation maximum cost circulation |
| ISSN号 | 0302-9743 |
| 英文摘要 | In this paper we consider a reverse center location problem in which we wish to spend as less cost as possible to ensure that the distances from a given vertex to all other vertices in a network are within given upper bounds. We first show that this problem is NP-hard. We then formulate the problem as a mixed integer programming problem and propose a heuristic method to solve this problem approximately on a spanning tree. A strongly polynomial method is proposed to solve the reverse center location problem on this spanning tree. |
| WOS研究方向 | Computer Science ; Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000165143000029 |
| 出版者 | SPRINGER-VERLAG BERLIN |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/15784]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Zhang, JZ |
| 作者单位 | 1.City Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China 2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Zhang, JZ,Yang, XG,Cai, MC. Reverse center location problem[J]. ALGORITHMS AND COMPUTATIONS,2000,1741:279-294. |
| APA | Zhang, JZ,Yang, XG,&Cai, MC.(2000).Reverse center location problem.ALGORITHMS AND COMPUTATIONS,1741,279-294. |
| MLA | Zhang, JZ,et al."Reverse center location problem".ALGORITHMS AND COMPUTATIONS 1741(2000):279-294. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。