New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- 1 December 1979
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 27 (6) , 1101-1114
- https://doi.org/10.1287/opre.27.6.1101
Abstract
In this paper, we develop four heuristic methods to obtain approximate solutions to the multidimensional 0-1 knapsack problem. The four methods are tested on a number of problems of various sizes. The solutions are compared to the rigorous optimum as well as to a heuristic method of Toyoda. They are statistically better than the latter, with average relative errors of the order of less than 1%.Keywords
This publication has 0 references indexed in Scilit: