formal programming for the shortest path and its critical edge problems

	formal programming for the shortest path and its critical edge problems
	Zheng Yujun; Xue Jinyun; Shi Haihe
	2007
会议名称	2007 IEEE International Conference on Automation and Logistics, ICAL 2007
会议录名称	Proceedings of the IEEE International Conference on Automation and Logistics, ICAL 2007
页码	72-76
会议日期	August 18,
会议地点	Jinan, China
收录类别	EI
出版地	United States
ISBN	1424415314
部门归属	(1) Provincial Key Laboratory of High Performance Computing, Jiangxi Normal University, Nanchang 330027, China; (2) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (3) Graduate University, Chinese Academy of Sciences, 100080 Bei
摘要	Many problems in operations research can be formulated in terms of networks, among which the shortest path is a particularly important class. Using the PAR method, we formally derive and implement algorithmic programs for three typical network problems, i
关键词	Algorithms Computer Programming Problem Solving Trees (Mathematics)
主办者	IEEE Robotics and Automation Society; Shandong University; The Chinese University of Hong Kong
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/10896
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Zheng Yujun,Xue Jinyun,Shi Haihe. formal programming for the shortest path and its critical edge problems[C]. United States,2007:72-76.