This is the group's project
-
Updated
Nov 30, 2024 - Jupyter Notebook
#
knapsack0-1
Here are 4 public repositories matching this topic...
This is an implementation of the 0-1 knapsack problem in C using a recursive approach. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.
c
knapsack-problem
knapsack
knapsack-solver
knapsack-solution
knapsack01
knapsack0-1
knapsack-01
knapsack-problem-recursive
knapsack-recursive
-
Updated
Jan 14, 2023 - C
This is an implementation of the 0-1 knapsack problem in C using dynamic programming. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.
c
knapsack-problem
knapsack
knapsack-solver
knapsack-solution
knapsack01
knapsack-problem-dynamic
knapsack0-1
-
Updated
Jan 14, 2023 - C
This is an implementation of the 0-1 knapsack problem in C using a greedy algorithm. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.
c
greedy
greedy-algorithms
knapsack-problem
greedy-algorithm
knapsack
greedy-programming
knapsack-solver
knapsack01
knapsack-problem-greedy
knapsack0-1
knapsack-01
knapsack-greedy
-
Updated
Jan 14, 2023 - C
Improve this page
Add a description, image, and links to the knapsack0-1 topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the knapsack0-1 topic, visit your repo's landing page and select "manage topics."