Inverse Center Location Problem on a Tree

doi:10.1007/s11424-008-9142-6

CSpace > 系统科学研究所

	Inverse Center Location Problem on a Tree
	Yang, Xiaoguang1 ; Zhang, Jianzhong 2
	2008-12-01
发表期刊	JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY
ISSN	1009-6124
卷号	21 期号:4 页码:651-664
摘要	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.
关键词	Center location combinatorial linear program tree two-terminal series parallel graphs
DOI	10.1007/s11424-008-9142-6
语种	英语
资助项目	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类目	Mathematics, Interdisciplinary Applications
WOS记录号	WOS:000260878200013
出版者	SPRINGER
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/6185
专题	系统科学研究所
通讯作者	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.