作者: Richard Loulou , Eleftherios Michaelides
关键词: Heuristic (computer science) 、 Cutting stock problem 、 Mathematics 、 Knapsack problem 、 Heuristics 、 Continuous knapsack problem 、 Change-making problem 、 Generalized assignment problem 、 Mathematical optimization 、 Management Science and Operations Research 、 Computer Science Applications
摘要: In this paper, we develop four heuristic methods to obtain approximate solutions the multidimensional 0-1 knapsack problem. The are tested on a number of problems various sizes. compared rigorous optimum as well method Toyoda. They statistically better than latter, with average relative errors order less 1%.