A Computational Study of a Multiple-Choice Knapsack Algorithm

Abstract

The results from the computational testmg of an algorithm designed to solve large-scale multiplechoice knapsack problems are described. Data list structures, sorting techniques, and fathommg criteria are investigated. It is determmed that considerable storage space can be ehmmated from the original implementation of the algonthm without affecting execution time Also the msertion of a heap sort m the algorithm does provide a substantial reduction in computing time when solving the larger problems. Theoretical results relating to the multiple-choice knapsack are presented. © 1983, ACM. All rights reserved.