There are 3 repositories under knapsack-problem topic.
A consolidated collection of resources for you to learn and understand algorithms and data structures easily.
Aditya Verma (Youtube) DP Playlist Codes/Solutions.
Operations research tools for Ruby
Sharing my journey :purple_heart: of Dynamic Programming :dizzy: :fire: . This would not be possible without Aditya Verma's DP series :pray: :point_down: :point_down:
✔ 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
This is the repository of codes written in class.
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, Fibonacci
Humble 3D knapsack / bin packing solver
Evolutionary Algorithm for the 2D Packing Problem combined with the 0/1 Knapsack Problem (Master Thesis)
Solving Knapsack 0/1 problem with various Local Search algorithms like Hill Climbing, Genetic Algorithms, Simulated Annealing, Tabu Search
Exact solutions for two-dimensional bin packing problems by branch-and-cut
Knapsack Problem solved using Genetic optimization algorithm
A hybrid genetic and simulated annealing algorithm in solving the knapsack 0-1 problem
Multiple-choice knapsack problem
Implementations of Fundamental Algorithms & Data Structures in C++.
Contains implementations of cache-optimized and external memory algorithms.
This package implements "0-1 Knapsack Problem" algorithm i.e. allows to find the best way to fill a knapsack of a specified volume with items of a certain volume and value.
GKNAP: A Java and C++ package for solving the multidimensional knapsack problem
A genetic algorithm I created in order find optimal solutions for the multiple knapsack problem
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.
My codes for CSE221 Brac University in Python 3.
Knapsack Problem implemented in Python. This includes a Linear Greedy and Quadratic Knapsack Implementation.
A web app that generates the most optimized lineups for DraftKings. Front end developed in React (Next.js), Redux, and TailwindCSS
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).
2D linear cut optimizer: gives number of Lengths required and instructions to cut | C# Application
Some fun code I wrote. One file does string matching and another one solves the Knapsack problem.
App for optimising pallets placement in containers using Python and VIKTOR.
Nested branch-and-bound algorithm to solve two-dimensional orthogonal packing problems