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

Solution implementation for HackerRank's Array-Subsets problem.

Must Do Coding Questions

Genetic Algorithm for Knapsack Problem

Simulated Annealing and Tabu Search are selected to solve the 0-1 knapsack problem.

New exact algorithms for integer and rational numbers: unbounded 1-0 M dimensional knapsack, N way sum partition, T group N sum partition, and MKS problems in Python3 and C++.

This repository is all about various concepts related Dynamic Programming.It also contains solutions to problems from various online judges, organized by topic.

Branch and Bound Algorithm for the 0/1 Knapsack Problem using Lagrangian Relaxation

Knapsack 0-1 problem in Python

0/1 Knapsack using Genetic Algorithm written in Java

A genetic algorithm implementation of the binary Knapsack problem.

A genetic 01-Knapsack problem solver in CUDA

Using Dynamic Programming (DP) method to optimize a 0/1 Knapsack Problem for Amazon shopping list.

In this repository i am going to keep some of the important notes and programs which are most useful while Coding.

Multiple Disjunctively Constrained Knapsak problem: definition and an approximation algorithm implementation.

Data Structures and Algorithms with commented explanations.

Paper to be submitted to GECCO 2021

This is an implementation of the 0-1 knapsack problem in C using a recursive approach. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.

KNAPSACKer is a universal toolset for solving different types of knapsack (0/1) problems, that is capable of statistical analysis and data visualization.