Computational Burden Analysis for Integer Knapsack Problems Solved with Dynamic Programming
[ 1 ] Instytut Automatyki i Inżynierii Informatycznej, Wydział Elektryczny, Politechnika Poznańska | [ P ] pracownik
2017
rozdział w monografii naukowej / referat
angielski
- Optimization
- Computational Burden
- Dynamic Programming
- Knapsack Algorithm
EN The paper presents the results concerning computational burden analysis of dynamic programming and bottom-up algorithms when solving knapsack problems. It presents the efficiency of the algorithms information expressed both in calculation time, as well as mean number of iterations in knapsack problems up to 15,000 items and capacity of the knapsack equal to 10,000. The aim of the paper is to present the this knowledge what of practical use when solving optimization problems where estimate of execution time of the algorithm is important.
215 - 220
CC BY-NC-ND (uznanie autorstwa - użycie niekomercyjne - bez utworów zależnych)
witryna wydawcy
ostateczna wersja opublikowana
publiczny
5