You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
15 March 2019Experimental evaluation of some approximate algorithms of solving the multidimensional knapsack problem
Birute I. Yuhimenko,1 Svitlana V. Kornilova,1 Inna O. Asaulyuk,2 Piotr Kisała,3 Saule Luganskaya,3 Indira Shedreyeva4
1Odessa National Polytechnic Univ. (Ukraine) 2Vinnytsia State Pedagogical Univ. (Ukraine) 3Lublin Univ. of Technology (Poland) 4Taraz State Univ. (Kazakhstan)
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.
The alert did not successfully save. Please try again later.
Birute I. Yuhimenko, Svitlana V. Kornilova, Inna O. Asaulyuk, Piotr Kisała, Saule Luganskaya, Indira Shedreyeva, "Experimental evaluation of some approximate algorithms of solving the multidimensional knapsack problem," Proc. SPIE 11045, Optical Fibers and Their Applications 2018, 1104517 (15 March 2019); https://doi.org/10.1117/12.2523175