Experimental evaluation of some approximate algorithms of solving the multidimensional knapsack problem

Piotr A. Kisała, Birute I. Yuhimenko, Svitlana V. Kornilova, Інна Олексіївна Асаулюк, Saule Luganskaya, Indira Shedreyeva

2019

Closed access Metadata (CSL-JSON)

DOI 10.1117/12.2523175

Data confidence 70 medium

How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

The results of an experimental study of obtaining approximate solutions of the multidimensional knapsack problem are presented in the paper. Three methods for obtaining these solutions are considered, based on branch-end-bound algorithms with a one-sided branching. One hundred test tasks of different dimensions have been solved for each method. The estimation of the approximation of the solutions obtained in relation to the best solution is provided, as well as the estimation of the computational complexity.