| 题名: | formal programming for the shortest path and its critical edge problems |
| 作者: | Zheng Yujun
; Xue Jinyun
; Shi Haihe
|
| 会议文集: | Proceedings of the IEEE International Conference on Automation and Logistics, ICAL 2007
|
| 会议名称: | 2007 IEEE International Conference on Automation and Logistics, ICAL 2007
|
| 会议日期: | August 18,
|
| 出版日期: | 2007
|
| 会议地点: | Jinan, China
|
| 关键词: | Algorithms
; Computer programming
; Problem solving
; Trees (mathematics)
|
| 出版地: | United States
|
| 收录类别: | EI
|
| 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
|
| 主办者: | IEEE Robotics and Automation Society; Shandong University; The Chinese University of Hong Kong
|
| 英文摘要: | 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 |
| 内容类型: | 会议论文
|
| URI标识: | http://ir.iscas.ac.cn/handle/311060/10896
|
| Appears in Collections: | 计算机科学国家重点实验室 _会议论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| 04338533.pdf（270KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
Zheng Yujun,Xue Jinyun,Shi Haihe. formal programming for the shortest path and its critical edge problems[C]. 见:2007 IEEE International Conference on Automation and Logistics, ICAL 2007. Jinan, China. August 18,.
|
|
|
