Skip to content
#

knapsack

Here are 211 public repositories matching this topic...

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
LR-QAOA

Fixed linear ramp schedules in QAOA constitute a universal set parameters, i.e., a set of γ and β parameters that rapidly approximate the optimal solution, x∗, independently of the COP selected, and that the success probability of finding it, probability(x∗), increases with the number of QAOA layers p.

  • Updated May 21, 2025
  • Jupyter Notebook

Improve this page

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

Learn more