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 |
| 会议日期 | August 18, |
| 会议地点 | Jinan, China |
| 关键词 | Algorithms Computer programming Problem solving Trees (mathematics) |
| 页码 | 72-76 |
| 英文摘要 | 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 |
| 收录类别 | EI |
| 会议主办者 | IEEE Robotics and Automation Society; Shandong University; The Chinese University of Hong Kong |
| 会议录 | Proceedings of the IEEE International Conference on Automation and Logistics, ICAL 2007
 |
| 会议录出版地 | United States |
| ISBN号 | 1424415314 |
| 源URL | [http://124.16.136.157/handle/311060/10896]  |
| 专题 | 软件研究所_计算机科学国家重点实验室 _会议论文 |
| 推荐引用方式 GB/T 7714 | 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,. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。