![]() Rivest (1990), Introduction to Algorithms, MIT Press, Massachusetts. Sandi (eds.), Combinatorial Optimization, Wiley, Chichester, 339–369. Theoretical Computer Science, 3, 293–304. Wong (1976), “Approximate algorithms for some generalized knapsack problems”. ![]() Toth (1997), “Exact Solution of Large Scale Quadratic Knapsack Problems”, Abstracts ISMP’97, EPFL, Lausanne, 24–29 August 1997.Ī. Pferschy (1995), “The Inverse-parametric Knapsack Problem”, European Journal of Operational Research, 83 376–393.Ī. Shetty (1979), “Computational results with a branch and bound algorithm for the general knapsack problem”, Naval Research Logistics Quarterly, 26, 41–46. Bellman (1957), Dynamic programming, Princeton University Press, Princeton, NJ. Jörnsten (1990), “Improved Lagrangean decomposition: An application to the generalized assignment problem”, European Journal of Operational Research, 46, 84–92. Zemel (1980), “An Algorithm for Large Zero-One Knapsack Problems”, Operations Research, 28, 1130–1154. Balas (1975), “Facets of the Knapsack Polytope”, Mathematical Programming, 8, 146–164.Į. Chvâtal, “Hard knapsack problems”, Operations Research, 28, 1410–1411.Į. Puech (1982), “Probabilistic analysis of the subset-sum problem”, Discrete Applied Mathematics, 4, 329–334.ĭ. Aittoniemi (1982), “Computational comparison of knapsack algorithms”, presented at XIth International Symposium on Mathematical Programming, Bonn, August 23–27. Finke (1975), “Merging and Sorting Applied to the Zero-One Knapsack Problem”, Operations Research, 23, 1099–1109.
0 Comments
Leave a Reply. |