Summary
This paper presents a survey of the unbounded knapsack problem. We focus on the techniques for obtaining the optimal solutions, particularly those using the periodic structure of the optimal solutions when the knapsack weight-carrying capacity b is sufficiently large. In addition to reviewing existing algorithms on the subject, the paper also includes two new algorithms, one for finding the onset of the optimal periodic solutions in time O(nw 1), where w 1 is the weight of the best item, i.e. the item with the highest value-to-weight ratio, and a second one for finding the optimal solutions when the capacity b is below the critical value where the optimal periodic solution begins. The second algorithm has a worst-case time complexity of O(nw 1 v 1), where v 1 is the value of the best item.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andonov, R., Poirriez, V., Rajopadhye, S.: Unbounded knapsack problem: dynamic programming revisited. Eur. J. Oper. Res. 12, 394–407 (2000)
Garey, M.R., Johnson, D.S.: Computer and Intractability. Freeman, San Francisco (1979)
Gilmore, P.C., Gomory, R.E.: The theory of computation of Knapsack functions. J. Oper. Res. Soc. Am. 14(6), 1045–1074 (1966)
Greenberg, H.: An algorithm for the periodic solutions in the knapsack problem. J. Math. Anal. Appl. 111, 327–331 (1985)
Hu, T.C.: Integer Programming and Network Flows. Addison-Wesley, Reading (1969)
Hu, T.C., Shing, M.T.: Combinatorial Algorithms, 2nd edn. Dover, Mineola (2002)
Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problem. J. Assoc. Comput. Mach. 22, 463–468 (1975)
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)
Landa, L.: Sage algorithms for Knapsack problem. Technical Report CS-2004-0794, UC San Diego, La Jolla, California (2004)
Lawler, E.L.: Fast approximation algorithms for knapsack problems. Math. Oper. Res. 4, 339–356 (1979)
Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990a)
Martello, S., Toth, P.: An exact algorithm for large unbounded knapsack problems. Oper. Res. Let. 9, 15–20 (1990b)
Pisinger, D.: Dynamic programming on the word RAM. Algorithmica 35, 128–145 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hu, T.C., Landa, L., Shing, MT. (2009). The Unbounded Knapsack Problem. In: Cook, W., Lovász, L., Vygen, J. (eds) Research Trends in Combinatorial Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76796-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-76796-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76795-4
Online ISBN: 978-3-540-76796-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)