problem reduction graph model for discrete optimization problems
文献类型：会议论文
| 作者 | Zheng Yujun ; Xue Jinyun |
| 出版日期 | 2010 |
| 会议名称 | 3rd International Joint Conference on Computational Sciences and Optimization, CSO 2010: Theoretical Development and Engineering Practice |
| 会议日期 | 43979 |
| 会议地点 | Huangshan, Anhui, China |
| 关键词 | Algorithms Combinatorial optimization Computer software reusability Inference engines Reusability |
| 页码 | 190-194 |
| 英文摘要 | The paper proposes the problem reduction graph (PRG), an abstract model for discrete optimization problems which uses structural decomposition to reduce problem complexity and constructs the recurrence relations between the problem and its subproblems. We develop several important algorithm patterns for PRG construction, each leading to a special class of concrete problem-solving algorithms in a systematic way. The model supports logical transformation from specifications to algorithmic programs by deductive inference, and thus significantly promotes the automation and reusability of algorithm design. © 2010 IEEE. |
| 会议主办者 | Chinese Academy of Sciences (CAS); Dep. Manage. Sci. Natl. Nat. Sci. Found. China (NSFC); Academy of Mathematics and Systems Science of CAS; Institute of Systems Science of CAS; Centre for Forecasting Science (CEFS) of CAS |
| 会议录 | 3rd International Joint Conference on Computational Sciences and Optimization, CSO 2010: Theoretical Development and Engineering Practice
 |
| 会议录出版地 | United States |
| ISBN号 | 9780770000000 |
| 源URL | [http://124.16.136.157/handle/311060/8860]  |
| 专题 | 软件研究所_计算机科学国家重点实验室 _会议论文 |
| 推荐引用方式 GB/T 7714 | Zheng Yujun,Xue Jinyun. problem reduction graph model for discrete optimization problems[C]. 见:3rd International Joint Conference on Computational Sciences and Optimization, CSO 2010: Theoretical Development and Engineering Practice. Huangshan, Anhui, China. 43979. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。