Institutional Repository
| formal programming for the shortest path and its critical edge problems | |
| Zheng Yujun; Xue Jinyun; Shi Haihe | |
| 2007 | |
| Conference Name | 2007 IEEE International Conference on Automation and Logistics, ICAL 2007 |
| Source | Proceedings of the IEEE International Conference on Automation and Logistics, ICAL 2007 |
| Pages | 72-76 |
| Conference Date | August 18, |
| Conference Place | Jinan, China |
| Indexed Type | EI |
| Publish Place | United States |
| 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 |
| 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 |
| Keyword | Algorithms Computer Programming Problem Solving Trees (Mathematics) |
| Sponsorship | IEEE Robotics and Automation Society; Shandong University; The Chinese University of Hong Kong |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/10896 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 04338533.pdf（270KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment