Inverse Problems of Some NP-Complete Problems

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-polynomi...

Full description

Saved in:
Bibliographic Details
Published inAlgorithmic Applications in Management pp. 422 - 426
Main Author Huang, Siming
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
Springer
SeriesLecture Notes in Computer Science
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
integer programming
Inverse problem
Knapsack problem
Mathematical programming
Operational research and scientific management
Operational research. Management science
pseudo-polynomial algorithm
Theoretical computing
Integer programming
Algorithmics
NP complete problem
Polynomial method
Inverse problem
Knapsack problem
Mathematical programming
Online AccessGet full text
ISBN3540262245
9783540262244
ISSN0302-9743
1611-3349
DOI10.1007/11496199_45

Cover

More Information
Summary: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.
ISBN:3540262245
9783540262244
ISSN:0302-9743
1611-3349
DOI:10.1007/11496199_45