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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K., Orlin, J.B.: Combinatorial algorithms for inverse network flow problems. Networks 40(4), 181–187 (2002)
Ahuja, R.K., Orlin, J.B.: A fast algorithm for the inverse spanning tree problem. J. of Algorithms 34, 177–193 (2000)
Burton, D., Toint, P.L.: On an instance of the inverse shortest paths problem. Mathematical Programming 53, 45–61 (1992)
Burton, D., Toint, P.L.: On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Mathematical Programming 63, 1–22 (1994)
Burton, D., Pulleyblank, B., Toint, P.L.: The inverse shortest paths problem with upper bounds on shortest paths costs. In: Pardalos, P., Hearn, D.W., Hager, W.H. (eds.) Network Optimization. Lecture notes in Economics and Mathematical Systems, vol. 450, pp. 156–171 (1997)
Dial, B.: Minimum-revenue congestion pricing, Part 1: A fast algorithm for the single-origin case. Technical Report, The Volpe National Transportation Systems Center, Kendall Square, Cambridge, MA 02142
Huang, S., Liu, Z.: On the inverse problem of linear programming and its application to minimum weight perfect k-matching. European Journal of Operational Research 112, 421–426 (1999)
Huang, S., Liu, Z.: On the inverse minimum cost flow problem. In: Advances in Operations Research and Systems Engineering, pp. 30–37. World Publishing, Co. (1998)
Heuberger, C.: Inverse combinatorial optimization: A survey on problems, methods, and results. J. of Combinatorial Optimization
Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Chichester (1986)
Sokkalingam, P.T., Ahuja, R.K., Orlin, J.B.: Solving inverse spanning tree problems through network flow techniques. Operations Research 47, 291–298 (1999)
Zhang, J., Liu, Z., Ma, Z.: On the inverse problem of minimum spanning tree with partition constraints. Mathematical Methods of Operations Research 44, 171–188 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, S. (2005). Inverse Problems of Some NP-Complete Problems. In: Megiddo, N., Xu, Y., Zhu, B. (eds) Algorithmic Applications in Management. AAIM 2005. Lecture Notes in Computer Science, vol 3521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496199_45
Download citation
DOI: https://doi.org/10.1007/11496199_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26224-4
Online ISBN: 978-3-540-32440-9
eBook Packages: Computer ScienceComputer Science (R0)