Heuristic for multicriteria multiple choice knapsack problem

Approximate heuristic for multicriteria multiple choice knapsack problem is suggested. Results of computing experiments for comparison of the suggested algorithm and exact enumerative algorithm are examined. Influence of parameters (number of elements, number of element groups) to algorithm efficiency is considered. Importance of resource constraints to algorithm efficiency and results is considered as well. Computational results are based on various initial data sets. Recommendations for the use of the suggested approximate algorithm in real problems are presented.