ANALYSIS OF GREEDY AND BACKTRACKING ALGORITHM ON KNAPSACK PROBLEM

Simple item page
dc.contributor.authorViolina, Sriyani
dc.date.accessioned2021-02-20T15:11:37Z
dc.date.available2021-02-20T15:11:37Z
dc.date.issued2020
dc.description.abstractGreedy and Backtracking approaches are two methods commonly used to solve optimization problems. Many problems can be solved using these two methods. The Greedy Algorithm is the most popular method for solving optimization problems. The Backtracking algorithm is an algorithm that applies DFS (Depth First Search) to its node tracing. Knapsack problem is a combinatorial problem, where a group of items is given each having a weight and value. Knapsack solution using Greedy does not always get optimal results while backtracking always achieves optimal results.en_US
dc.identifier.issn0038-111X
dc.identifier.urihttp://repository.widyatama.ac.id/xmlui/handle/123456789/12711
dc.language.isoenen_US
dc.publisherSolid State Technology Volume: 63 Issue: 3en_US
dc.subjectGreedyen_US
dc.subjectBacktracking Knapsacken_US
dc.titleANALYSIS OF GREEDY AND BACKTRACKING ALGORITHM ON KNAPSACK PROBLEMen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Sriyani Violina - Analysis of Greedy and Backtracking Algorithm on Knapsack Problem.pdf
Size:
199.73 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
International Journal