N.K. GURSOY, U.G. NURIYEV
GREEDY ALGORITHMS WITH GUARANTEE VALUE FOR 0/1 MINIMIZATION KNAPSACK PROBLEM


In this paper, we propose two new algorithms for 0-1 Minimization Knapsack problem by mentioning the well-known algorithms with guaranteed estimate. We present computational results and compare the proposed algorithms with the previous ones. Finally, we show that the second algorithm achieves an approximation guaranteed value 2.

Keywords: 0/1 knapsack problem, minimization, greedy algorithm, approximation, guarantee value
Copyright © 1997- Institute of Control Systems of Azerbaijan National Academy of Sciences. e-Mail: [email protected]