Computational Burden Analysis for Integer Knapsack Problems Solved with Dynamic Programming

Dariusz Horla

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Computational Burden Analysis for Integer Knapsack Problems Solved with Dynamic Programming

Topics: Decision Support Systems; Optimization Algorithms

In Proceedings of the 14th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, 215-220, 2017 , Madrid, Spain

Author: Dariusz Horla

Affiliation: Institute of Control and Information Engineering, Faculty of Electrical Engineering and Poznan University of Technology, Poland

Keyword(s): Optimization, Computational Burden, Dynamic Programming, Knapsack Algorithm.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Business Analytics ; Cardiovascular Technologies ; Computing and Telecommunications in Cardiology ; Data Engineering ; Decision Support Systems ; Decision Support Systems, Remote Data Analysis ; Health Engineering and Technology Applications ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Knowledge-Based Systems ; Optimization Algorithms ; Symbolic Systems

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.144.114.8

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

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; ISSN 2184-2809, SciTePress, pages 215-220. DOI: 10.5220/0006415302150220

@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},
issn={2184-2809},
}

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
IS - 2184-2809
AU - Horla, D.
PY - 2017
SP - 215
EP - 220
DO - 10.5220/0006415302150220
PB - SciTePress