Inverse problems of some NP-complete problems

	Inverse problems of some NP-complete problems
	Huang, SM
发表期刊	ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS
关键词	Inverse Problem Knapsack Problem Integer Programming Pseudo-polynomial Algorithm
摘要	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.
	2005
卷号	3521 期号:1 页码:5,422-426
ISSN	0302-9743
学科领域	Computer Science ; Theory & Methods ; Information Systems ; Interdisciplinary Applications ; Computer Science ; Computer Science
收录类别	SCI
语种	英语
WOS记录号	WOS:000230475100045
引用统计	被引频次：5[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://ir.casisd.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.