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
[NeurIPS 2023] DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimization
Sharing my 30 days long 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
Humble 3D knapsack / bin packing solver
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
Evolutionary Algorithm for the 2D Packing Problem combined with the 0/1 Knapsack Problem (Master Thesis)
Exact solutions for two-dimensional bin packing problems by branch-and-cut
This is the repository of codes written in class.
Solving Knapsack 0/1 problem with various Local Search algorithms like Hill Climbing, Genetic Algorithms, Simulated Annealing, Tabu Search
Knapsack Problem solved using Genetic optimization algorithm
App for optimising pallets placement in containers using Python and VIKTOR.
A Julia package for operations research subjects
A hybrid genetic and simulated annealing algorithm in solving the knapsack 0-1 problem
My codes for CSE221 Brac University in Python 3.
0-1 Knapsack DSA Algorithm
Contains implementations of cache-optimized and external memory algorithms.
A genetic algorithm I created in order find optimal solutions for the multiple knapsack problem
In this section, I share the Meta-Heuristic algorithm codes that I wrote myself
solving knapsack problem with n items with GA(genetic algorithm)
One-week side project to play around stochastic optimization (how to take *good* decisions under uncertainty)
Implementations of Fundamental Algorithms & Data Structures in C++.
Solution implementation for HackerRank's Array-Subsets problem.
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).
GKNAP: A Java and C++ package for solving the multidimensional knapsack problem
2D linear cut optimizer: gives number of Lengths required and instructions to cut | C# Application
Multiple-choice knapsack problem
Optimization as a service TUI