Bin Packing Problem using Neural Combinatorial Optimization.

Genetic Algorithm for Knapsack Problem

Leverage the power of modern C++ to build robust and scalable applications

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)

Auto Parallelization - runs test files in multiple jobs

Algorithms for solving knapsack problems with Python

Julia package to solve Knapsack problems

Exact and meta-heuristic algorithms for NP problems

An example pipeline that runs parallel tests for a Rails app using Docker and Knapsack.

A module for resource allocation solving

Optimize multiple knapsack problem using reinforcement learning.

Evolutionary Multitasking in Permutation-Based Combinatorial Optimization Problems: Realization with TSP and Knapsack

All DSA-2 topics are covered in the UIU DSA-2 course, including both lab and theory courses. Check DSA-1 Topics: https://github.com/TashinParvez/DSA_1_UIU

Knapsack algorithms

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

Classical algorithm implementation.

Solution implementation for HackerRank's Array-Subsets problem.

Heuristic solution for Knapsack Container Loading Problem (KCLP) implemented in C++ with visualization in python.

My team's Hash Code 2020 solutions

An example pipeline that runs Rails tests in parallel across multiple agents using Knapsack.

Knapsack Problem implemented in Python. This includes a Linear Greedy and Quadratic Knapsack Implementation.

This repository contains a C++ program that solves the Knapsack Problem using a Genetic Algorithm. The Knapsack Problem is a classic optimization problem where we aim to maximize the total value of items to be packed in a knapsack, given the knapsack's weight capacity and a set of items with their respective weights and values.

Design and Analysis of Algorithms (CS3230) - National University of Singapore

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.

A collection of simple C++ Programs involving the Design and Analysis of Algorithms.

No description provided.

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

Multi-Objective Discrete Optimization Instance Library

Implementation of the 0-1 Knapsack Problem