Bin Packing Problem using Neural Combinatorial Optimization.

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, Fibo…

Auto Parallelization - runs test files in multiple jobs

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

Algorithms for solving knapsack problems with Python

An example of how to run Rails CI and test steps in parallel with Docker and Buildkite

Exact and meta-heuristic algorithms for NP problems

Julia package to solve Knapsack problems

A module for resource allocation solving

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

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

Knapsack algorithms

Solution implementation for HackerRank's Array-Subsets problem.

Classical algorithm implementation.

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

My team's Hash Code 2020 solutions

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

An example of how to run Rails CI and test steps in parallel with Buildkite

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