Translator Disclaimer
Paper
15 March 2019 Experimental evaluation of some approximate algorithms of solving the multidimensional knapsack problem
Author Affiliations +
Proceedings Volume 11045, Optical Fibers and Their Applications 2018; 1104517 (2019) https://doi.org/10.1117/12.2523175
Event: 18th Conference on Optical Fibers and Their Applications, 2018, Naleczow, Poland
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.
© (2019) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Birute I. Yuhimenko, Svitlana V. Kornilova, Inna O. Asaulyuk, Piotr Kisała, Saule Luganskaya, and 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
PROCEEDINGS
7 PAGES


SHARE
Advertisement
Advertisement
Back to Top