Journal ArticleOPEN ACCESS

Greedy Approach for Optimizing 0-1 Knapsack Problem

  • Abidin S
Communications on Applied Electronics (2017) 7(6) 1-3
DOI: 10.5120/cae2017652675
N/ACitations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

ABSTRACT Abstract: 0--1 knapsack problem is a typical NP complete problem in field of computer. Traditional knapsack problem is solved recursively using backtracking, branch and bound, dynamic programming and greedy methods. The advantages of using recursive …

Cite

CITATION STYLE

APA

Abidin, S. (2017). Greedy Approach for Optimizing 0-1 Knapsack Problem. Communications on Applied Electronics, 7(6), 1–3. https://doi.org/10.5120/cae2017652675

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free