Evolutionary Algorithm for the 2D Packing Problem combined with the 0/1 Knapsack Problem (Master Thesis)

Knapsack Problem solved using Genetic optimization algorithm

Exact solutions for two-dimensional bin packing problems by branch-and-cut

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).

App for optimising pallets placement in containers using Python and VIKTOR.

A hybrid genetic and simulated annealing algorithm in solving the knapsack 0-1 problem

Binary genetic algorithm in python.

A genetic algorithm I created in order find optimal solutions for the multiple knapsack problem

genetic algorithm that implements knapsack problem solution by reading values and weights from a file

My codes for CSE221 Brac University in Python 3.

Genetic Algorithm for Knapsack Problem

This project aims to solve the famous 0-1 Knapsack Problem using various versions of the Genetic Algorithm.

One-week side project to play around stochastic optimization (how to take *good* decisions under uncertainty)

Knapsack problem solution using an implementation of a genetic algorithm and hill climbing.

Problems solved using Genetic Algorithms.

Python testbed for the Quadratic Multiple Knapsack Problem (QMKP)

Implementation of the Quadratic Knapsack Problem using Permutations as an encoding

Resolving the unbounded knapsack problem

Python development to solve the 0/1 Knapsack Problem using Markov Chain Monte Carlo techniques, dynamic programming and greedy algorithm.