Skip to content
#

knapsack-solution

Here are 16 public repositories matching this topic...

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.

  • Updated Jan 14, 2023
  • C

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.

  • Updated Jan 14, 2023
  • C

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

Skrypt python służący do wizualizacji i rozwiązywania problemu plecakowego, wykorzystująca matplotlib, numpy oraz pandas do analizy i graficznego przedstawienia optymalnych kombinacji wag i wartości przedmiotów. Idealny do wizualizacji problemu co ułatwi jego zrozumienie oraz naukę.

  • Updated Jun 25, 2024
  • Python

Add this topic to your repo

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

Learn more