AAIM 2005: Algorithmic Applications in Management pp 440-449 | Cite as
A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint
Conference paper
Abstract
In this paper, we develop a new and effective schedule algebra based algorithm to determine the K-best solutions of a knapsack problem with a single constraint. Computational experience with this algorithm is also reported and it is shown to dominate both the dynamic programming and branch and bound based procedures when applied to this problem.
Keywords
Knapsack Problem Good Path Large Size Problem Single Constraint Naval Research Logistics
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Balas, E., Zemel, E.: An Algorithm for Large Zero-One Knapsack Problem. Operations Research 28(5), 1130–1154 (1980)MATHCrossRefMathSciNetGoogle Scholar
- 2.Bretthauer, K.M., Shetty, B.: The nonlinear knapsack problem - algorithms and applications. European Journal of Operational Research 138(3), 459–472 (2002)MATHCrossRefMathSciNetGoogle Scholar
- 3.Eppstein, D.: Finding the k shortest paths. SIAM Journal of Computing 28, 652–673 (1998)MATHCrossRefMathSciNetGoogle Scholar
- 4.Giffler, B.: Schedule Algebra: A Progress Report. Naval Research Logistics Quarterly 15, 255–280 (1968)Google Scholar
- 5.Lin, E.: A bibliographical survey on some well-known non-standard knapsack problems. INFOR 36(4), 274–317 (1998)Google Scholar
- 6.Salkin, H.M., Kluyver, C.: Knapsack problem – Survey. Naval Research Logistics 22(1), 127–144 (1975)MATHCrossRefGoogle Scholar
- 7.Sarin, S.C.: Mixed Disc Packing Problem: Part I. IIE Transactions 15(1), 37–45 (1983)CrossRefMathSciNetGoogle Scholar
- 8.Sarin, S.C., Ahn, S.: Mixed Disc Packing Problem: Part II. IIE Transactions 15(2), 91–98 (1983)CrossRefGoogle Scholar
- 9.Shapiro, J.F.: Dynamic Programming Algorithm for Integer Programming Problem I: The Integer Programming Problem Viewed as a Knapsack Type Problem. Operations Research 16(1), 103–121 (1968)MATHCrossRefMathSciNetGoogle Scholar
- 10.Shier, D.R.: Interactive Methods for Determining the K Shortest Paths in a Network. Networks 6, 205–229 (1976)MATHCrossRefMathSciNetGoogle Scholar
- 11.Wongseelashote, A.: An Algebra for Determining all Path-Values in a Network with Application to K-Shortest-Paths Problems. Networks 6, 307–334 (1976)MATHCrossRefMathSciNetGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2005