Inverse center location problem on a tree

doi:10.1007/s11424-008-9142-6

科研成果详情

题名	Inverse center location problem on a tree
作者	Yang，Xiaoguang 1; Zhang，Jianzhong 2
发表日期	2008
发表期刊	Journal of Systems Science and Complexity
ISSN/eISSN	1009-6124
卷号	21 期号:4 页码:643-656
摘要	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( log V) time algorithm to solve the problem is presented. For the equal cost case, the authors further give an O(V) time algorithm. © 2008 Academy of Mathematics & Systems Science, Beijing, China.
关键词	Center location Combinatorial linear program Tree Two-terminal series parallel graphs
DOI	10.1007/s11424-008-9142-6
URL	查看来源
语种	英语English
Scopus入藏号	2-s2.0-55649103704
引用统计	被引频次：22[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	https://repository.uic.edu.cn/handle/39GCC9TT/6662
专题	北师香港浸会大学
通讯作者	Yang，Xiaoguang
作者单位	1.Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing 100190,China 2.United International College,Hong Kong Baptist University,Zhuhai 519085,China
推荐引用方式 GB/T 7714	Yang，Xiaoguang,Zhang，Jianzhong. Inverse center location problem on a tree[J]. Journal of Systems Science and Complexity, 2008, 21(4): 643-656.
APA	Yang，Xiaoguang, & Zhang，Jianzhong. (2008). Inverse center location problem on a tree. Journal of Systems Science and Complexity, 21(4), 643-656.
MLA	Yang，Xiaoguang,et al."Inverse center location problem on a tree". Journal of Systems Science and Complexity 21.4(2008): 643-656.