中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Inverse Center Location Problem on a Tree

文献类型:期刊论文

作者Yang, Xiaoguang1; Zhang, Jianzhong2
刊名JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY
出版日期2008-12-01
卷号21期号:4页码:651-664
关键词Center location combinatorial linear program tree two-terminal series parallel graphs
ISSN号1009-6124
DOI10.1007/s11424-008-9142-6
英文摘要This paper discusses the inverse center location problem restricted on a tree with different costs and bound constraints. The authors first show that the problem can be formulated as a series of combinatorial linear programs, then an O(V2 log V) time algorithm to solve the problem is presented. For the equal cost case, the authors further give an O(V) time algorithm.
资助项目National Natural Science Foundation of China[70425004] ; National Natural Science Foundation of China[70221001] ; National Key Research and Development Program of China[2002CB312004]
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000260878200013
出版者SPRINGER
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/6184]  
专题系统科学研究所
通讯作者Yang, Xiaoguang
作者单位1.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
2.Hong Kong Baptist Univ, United Int Coll, Zhuhai 519085, Peoples R China
推荐引用方式
GB/T 7714
Yang, Xiaoguang,Zhang, Jianzhong. Inverse Center Location Problem on a Tree[J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY,2008,21(4):651-664.
APA Yang, Xiaoguang,&Zhang, Jianzhong.(2008).Inverse Center Location Problem on a Tree.JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY,21(4),651-664.
MLA Yang, Xiaoguang,et al."Inverse Center Location Problem on a Tree".JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY 21.4(2008):651-664.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。