Inverse problems of some NP-complete problems
文献类型：期刊论文
| 作者 | Huang, SM |
| 刊名 | ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS
 |
| 出版日期 | 2005 |
| 卷号 | 3521期号:1页码:5,422-426 |
| 关键词 | inverse problem Knapsack problem integer programming pseudo-polynomial algorithm |
| ISSN号 | 0302-9743 |
| 中文摘要 | The Knapsack problem and integer programming are NP-complete problems. In this paper we show that the inverse problem of Knapsack problem can be solved with a pseudo-polynomial algorithm. We also show that the inverse problem of integer programming with fixed number of constraints is pseudo-polynomial. |
| 学科主题 | Computer Science ; Information Systems; Computer Science ; Interdisciplinary Applications; Computer Science ; Theory & Methods |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000230475100045 |
| 公开日期 | 2012-11-12 |
| 源URL | [http://ir.casipm.ac.cn/handle/190111/5001]  |
| 专题 | 科技战略咨询研究院_中国科学院科技政策与管理科学研究所(1985年6月-2015年12月) |
| 推荐引用方式 GB/T 7714 | Huang, SM. Inverse problems of some NP-complete problems[J]. ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS,2005,3521(1):5,422-426. |
| APA | Huang, SM.(2005).Inverse problems of some NP-complete problems.ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS,3521(1),5,422-426. |
| MLA | Huang, SM."Inverse problems of some NP-complete problems".ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS 3521.1(2005):5,422-426. |
入库方式： OAI收割
来源：科技战略咨询研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。