| Title: | formal programming for the shortest path and its critical edge problems |
| Author: | Zheng Yujun
; Xue Jinyun
; Shi Haihe
|
| Source: | Proceedings of the IEEE International Conference on Automation and Logistics, ICAL 2007
|
| Conference Name: | 2007 IEEE International Conference on Automation and Logistics, ICAL 2007
|
| Conference Date: | August 18,
|
| Issued Date: | 2007
|
| Conference Place: | Jinan, China
|
| Keyword: | Algorithms
; Computer programming
; Problem solving
; Trees (mathematics)
|
| Publish Place: | United States
|
| Indexed Type: | EI
|
| ISBN: | 1424415314
|
| Department: | (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
|
| Sponsorship: | IEEE Robotics and Automation Society; Shandong University; The Chinese University of Hong Kong
|
| English Abstract: | 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 |
| Content Type: | 会议论文
|
| 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,.
|
|
|
