Skip to content
#

knapsack-problem

Here are 292 public repositories matching this topic...

recursion-and-dynamic-programming

Julia and Python recursion algorithm and dynamic programming applications including Edit Distance, Knapsack (Multiple Choice), Stock Trading, Sierpiński Carpet, Pascal Triangle, Prime Factorization, Palindrome, Coin Change, Hanoi Tower, Fibonacci

  • Updated May 13, 2021
  • Julia

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

Improve this page

Add a description, image, and links to the knapsack-problem 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 topic, visit your repo's landing page and select "manage topics."

Learn more