Inverse problems of some NP-complete problems

Authors:
Siming Huang
Affiliations:
Institute of Policy and Management, Chinese Academy of Sciences, Beijing, P.R. China
Venue:
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Year:
2005

Citing 5
Cited 3

Theory of linear and integer programming

Theory of linear and integer programming
On an instance of the inverse shortest paths problem

Mathematical Programming: Series A and B
On the use of an inverse shortest paths algorithm for recovering linearly correlated costs

Mathematical Programming: Series A and B
A faster algorithm for the inverse spanning tree problem

Journal of Algorithms
Solving Inverse Spanning Tree Problems Through Network Flow Techniques

Operations Research

Cutting plane algorithms for the inverse mixed integer linear programming problem

Operations Research Letters
Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem

Journal of Global Optimization
Note: Inverse multi-objective combinatorial optimization

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.