Computational Burden Analysis for Integer Knapsack Problems Solved with Dynamic Programming

Dariusz Horla

Abstract

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.

Download


Paper Citation


in Harvard Style

Horla D. (2017). Computational Burden Analysis for Integer Knapsack Problems Solved with Dynamic Programming . In Proceedings of the 14th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-758-263-9, pages 215-220. DOI: 10.5220/0006415302150220


in Bibtex Style

@conference{icinco17,
author={Dariusz Horla},
title={Computational Burden Analysis for Integer Knapsack Problems Solved with Dynamic Programming},
booktitle={Proceedings of the 14th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2017},
pages={215-220},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006415302150220},
isbn={978-989-758-263-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 14th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - Computational Burden Analysis for Integer Knapsack Problems Solved with Dynamic Programming
SN - 978-989-758-263-9
AU - Horla D.
PY - 2017
SP - 215
EP - 220
DO - 10.5220/0006415302150220