Skip to content
#

knapsack-problem

Here are 521 public repositories matching this topic...

✔ My Solutions of (Algorithmic-Toolbox ) Assignments from Coursera ( University of California San Diego ) With "Go In Depth" Part Which Contains More Details With Each of The Course Topics

  • Updated May 30, 2022
  • C++
recursion-and-dynamic-programming

Julia and Python recursion algorithm, fractal geometry and dynamic programming applications including Edit Distance, Knapsack (Multiple Choice), Stock Trading, Pythagorean Tree, Koch Snowflake, Jerusalem Cross, Sierpiński Carpet, Hilbert Curve, Pascal Triangle, Prime Factorization, Palindrome, Egg Drop, Coin Change, Hanoi Tower, Cantor Set, Fibo…

  • Updated Jul 19, 2023
  • 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

This is the implementation of 3rd Part in 3-Part Series of Algorithms Illuminated Book. All Implementations in this repository are written in both Python and Golang. Single IPython Notebook contains all Algorithms given in this Part 3.

  • Updated Apr 7, 2021
  • Jupyter Notebook

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