A total-value greedy heuristic for the integer knapsack problem
暂无分享,去创建一个
This paper examines a new greedy heuristic for the integer knapsack problem. The proposed heuristic selects items in non-increasing order of their maximum possible contribution to the solution value given the available knapsack capacity at each step. The lower bound on the performance ratio for this ''total-value'' greedy heuristic is shown to dominate the corresponding lower bound for the density-ordered greedy heuristic.
[1] Eugene L. Lawler,et al. Parameterized Approximation Scheme for the Multiple Knapsack Problem , 2009, SIAM J. Comput..
[2] M. Fisher. Worst-Case Analysis of Heuristic Algorithms , 1980 .
[3] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .
[4] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.
[5] Leslie E. Trotter,et al. When the Greedy Solution Solves a Class of Knapsack Problems , 1975, Oper. Res..