CSpace
THE QUADRATIC MINIMUM SPANNING TREE PROBLEM
ASSAD, A; XU, WX
1992-04-01
Source PublicationNAVAL RESEARCH LOGISTICS
ISSN0894-069X
Volume39Issue:3Pages:399-417
AbstractThis 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.
Language英语
WOS Research AreaOperations Research & Management Science
WOS SubjectOperations Research & Management Science
WOS IDWOS:A1992HL94600008
PublisherJOHN WILEY & SONS INC
Citation statistics
Cited Times:34[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/28194
Collection中国科学院数学与系统科学研究院
AffiliationCHINESE ACAD SCI,INST APPL MATH,BEIJING,PEOPLES R CHINA
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[ASSAD, A]'s Articles
[XU, WX]'s Articles
Baidu academic
Similar articles in Baidu academic
[ASSAD, A]'s Articles
[XU, WX]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[ASSAD, A]'s Articles
[XU, WX]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.