Heuristic solution for Knapsack Container Loading Problem (KCLP) implemented in C++ with visualization in python.
travelling salesman problem visualized.
Solving rucksack (or knapsack) problem with python3. No numpy, no nothing, only free hand-written code.
I love TSP problem, I usually use this in other topics but here need to design TSP problem to find minimum cost for moving between cities.
Algorithm analysis of NP-Hard problem called Maximum Set Packing.
An analysis of a NP-Complete Graph Colouring problem 3-Colourability and an approximate algorithm analysis that solves 3-COL.
Another Numeric and Metaheuristics Library
This project aims to solve the Travelling Salesman Problem (TSP) using two heuristic approaches: Genetic Algorithm (GA) and Simulated Annealing (SA). The ATT48 dataset is used as a benchmark to compare their efficiency in finding the shortest possible route while visiting all cities exactly once.
Add a description, image, and links to the nphard topic page so that developers can more easily learn about it.
To associate your repository with the nphard topic, visit your repo's landing page and select "manage topics."