Inverse problems of some NP-complete problems
Huang, SM
2005
Source PublicationALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS
ISSN0302-9743
Volume3521Issue:1Pages:5,422-426
AbstractThe 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.
KeywordInverse Problem Knapsack Problem Integer Programming Pseudo-polynomial Algorithm
Subject AreaComputer Science ; Theory & Methods ; Information Systems ; Interdisciplinary Applications ; Computer Science ; Computer Science
Indexed BySCI
Language英语
WOS IDWOS:000230475100045
Citation statistics
Cited Times:5[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.casisd.cn/handle/190111/5001
Collection中国科学院科技政策与管理科学研究所(1985年6月-2015年12月)
Recommended Citation
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.
Files in This Item:
File Name/Size DocType Version Access License
Inverse Problems of (87KB) 开放获取--View Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Huang, SM]'s Articles
Baidu academic
Similar articles in Baidu academic
[Huang, SM]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Huang, SM]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: Inverse Problems of Some NP-Complete Problems .pdf
Format: Adobe PDF
This file does not support browsing at this time
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.