Skip to content
#

knapsack-problem-greedy

Here are 19 public repositories matching this topic...

This repository was created for the subject of Computer Theory. The propose of this subject is to improve your skills to solve the 0-1 knapsack problem of different ways. The techniques used were Dynamic Programing and two metaheuristics (which are GRASP and TABU search).

  • Updated Jul 3, 2020
  • Python

implementation of dynamic and greedy approach solution for a problem. Which is a car company that produces given amount of cars every month with investments, profits costs etc. Profits are from car sales and investments.

  • Updated Jul 18, 2020
  • Java

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.

  • Updated Jan 14, 2023
  • C

Improve this page

Add a description, image, and links to the knapsack-problem-greedy topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the knapsack-problem-greedy topic, visit your repo's landing page and select "manage topics."

Learn more