QQ客服 官方微博 反馈留言

	An exact algorithm for constrained shortest path problem based on dichotomy
	Zhou, Kang*; Duan, Yingying; Dong, Wenbo; Fu, Qinhong
刊名	Journal of Computational and Theoretical Nanoscience
	2016
卷号	13期号:6页码:3835-3844
关键词	CSPP DICHOTOMY DIJKSTRA ALGORITHM NETWORK ANALYSIS SHORTEST PATH
ISSN号	1546-1955
DOI	10.1166/jctn.2016.5217
URL标识	查看原文
WOS记录号	EI:20164002870087
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/5581643
专题	武汉轻工大学
作者单位	1.[Duan, Yingying 2.Zhou, Kang 3.Fu, Qinhong 4.Dong, Wenbo] School of Math and Computer, Wuhan Polytechnic University, Wuhan, 430023, China
推荐引用方式 GB/T 7714	Zhou, Kang*,Duan, Yingying,Dong, Wenbo,et al. An exact algorithm for constrained shortest path problem based on dichotomy[J]. Journal of Computational and Theoretical Nanoscience,2016,13(6):3835-3844.
APA	Zhou, Kang*,Duan, Yingying,Dong, Wenbo,&Fu, Qinhong.(2016).An exact algorithm for constrained shortest path problem based on dichotomy.Journal of Computational and Theoretical Nanoscience,13(6),3835-3844.
MLA	Zhou, Kang*,et al."An exact algorithm for constrained shortest path problem based on dichotomy".Journal of Computational and Theoretical Nanoscience 13.6(2016):3835-3844.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。