a problem reduction based approach to discrete optimization algorithm design
文献类型：期刊论文
| 作者 | Zheng Yujun ; Xue Jinyun |
| 刊名 | COMPUTING
 |
| 出版日期 | 2010 |
| 卷号 | 88期号:40545页码:31-54 |
| 关键词 | Discrete optimization Program calculation Problem reduction graph (PRG) Algorithm design |
| ISSN号 | 0010-485X |
| 学科主题 | Computer Science ; Theory & Methods |
| 公开日期 | 2011-05-23 |
| 附注 | The paper presents a novel approach to formal algorithm design for a typical class of discrete optimization problems. Using a concise set of program calculation rules, our approach reduces a problem into subproblems with less complexity based on function decompositions, constructs the problem reduction graph that describes the recurrence relations between the problem and subproblems, from which a provably correct algorithm can be mechanically derived. Our approach covers a large variety of algorithms and bridges the relationship between conventional methods for designing efficient algorithms (including dynamic programming and greedy) and some effective methods for coping with intractability (including approximation and parameterization). |
| 源URL | [http://124.16.136.157/handle/311060/9660]  |
| 专题 | 软件研究所_计算机科学国家重点实验室 _期刊论文 |
| 推荐引用方式 GB/T 7714 | Zheng Yujun,Xue Jinyun. a problem reduction based approach to discrete optimization algorithm design[J]. COMPUTING,2010,88(40545):31-54. |
| APA | Zheng Yujun,&Xue Jinyun.(2010).a problem reduction based approach to discrete optimization algorithm design.COMPUTING,88(40545),31-54. |
| MLA | Zheng Yujun,et al."a problem reduction based approach to discrete optimization algorithm design".COMPUTING 88.40545(2010):31-54. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。