THE QUADRATIC MINIMUM SPANNING TREE PROBLEM

CSpace

	THE QUADRATIC MINIMUM SPANNING TREE PROBLEM
	ASSAD, A; XU, WX
	1992-04-01
发表期刊	NAVAL RESEARCH LOGISTICS
ISSN	0894-069X
卷号	39 期号:3 页码:399-417
摘要	This article introduces a new optimization problem that involves searching for the spanning tree of minimum cost under a quadratic cost structure. This quadratic minimum spanning tree problem is proven to be NP-hard. A technique for generating lower bounds for this problem is discussed and incorporated into branch-and-bound schemes for obtaining exact solutions. Two heuristic algorithms are also developed. Computational experience with both exact and heuristic algorithms is reported.
语种	英语
WOS研究方向	Operations Research & Management Science
WOS类目	Operations Research & Management Science
WOS记录号	WOS:A1992HL94600008
出版者	JOHN WILEY & SONS INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/28194
专题	中国科学院数学与系统科学研究院
通讯作者	ASSAD, A
作者单位	CHINESE ACAD SCI,INST APPL MATH,BEIJING,PEOPLES R CHINA
推荐引用方式 GB/T 7714	ASSAD, A,XU, WX. THE QUADRATIC MINIMUM SPANNING TREE PROBLEM[J]. NAVAL RESEARCH LOGISTICS,1992,39(3):399-417.
APA	ASSAD, A,&XU, WX.(1992).THE QUADRATIC MINIMUM SPANNING TREE PROBLEM.NAVAL RESEARCH LOGISTICS,39(3),399-417.
MLA	ASSAD, A,et al."THE QUADRATIC MINIMUM SPANNING TREE PROBLEM".NAVAL RESEARCH LOGISTICS 39.3(1992):399-417.