There are 1 repository under nphard topic.
Heuristic solution for Knapsack Container Loading Problem (KCLP) implemented in C++ with visualization in python.
An analysis of a NP-Complete Graph Colouring problem 3-Colourability and an approximate algorithm analysis that solves 3-COL.
Solving rucksack (or knapsack) problem with python3. No numpy, no nothing, only free hand-written code.
Algorithm analysis of NP-Hard problem called Maximum Set Packing.