LINK ENHANCEMENT USING CONSTRAINED RANGE AND REDUCED CANDIDATE SET SEARCHES - A REVISION

doi:10.1016/0140-3664(95)99817-V

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	LIN, RY	en_US
dc.contributor.author	YANG, CY	en_US
dc.date.accessioned	2019-04-02T05:59:26Z	-
dc.date.available	2019-04-02T05:59:26Z	-
dc.date.issued	1995-09-01	en_US
dc.identifier.issn	0140-3664	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/0140-3664(95)99817-V	en_US
dc.identifier.uri	http://hdl.handle.net/11536/149151	-
dc.description.abstract	This paper revises the CRCS algorithm proposed by Yang(1). In the constrained range search, we use the cost and performance of candidate links to obtain the exact link range of the optimal solution. Moreover, we use the concept of variable dominance to reduce the number of candidate links without loss of optimality. A comparison of results obtained using Yang's and the revised CRCS algorithm shows that the revised CRCS algorithm is superior to Yang's original version.	en_US
dc.language.iso	en_US	en_US
dc.subject	CANDIDATE SET SEARCH	en_US
dc.subject	CONSTRAINED RANGE SEARCH	en_US
dc.subject	VARIABLE DOMINANCE	en_US
dc.title	LINK ENHANCEMENT USING CONSTRAINED RANGE AND REDUCED CANDIDATE SET SEARCHES - A REVISION	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/0140-3664(95)99817-V	en_US
dc.identifier.journal	COMPUTER COMMUNICATIONS	en_US
dc.citation.volume	18	en_US
dc.citation.spage	663	en_US
dc.citation.epage	668	en_US
dc.contributor.department	管理科學系	zh_TW
dc.contributor.department	資訊管理與財務金融系註：原資管所+財金所	zh_TW
dc.contributor.department	Department of Management Science	en_US
dc.contributor.department	Department of Information Management and Finance	en_US
dc.identifier.wosnumber	WOS:A1995TA90600009	en_US
dc.citation.woscount	0	en_US
顯示於類別：	期刊論文