#
np-hard
Here are 4 public repositories matching this topic...
Interactive travelling salesman problem solver. Branch & bound | Simulated annealing.
optimization
np-hard
simulated-annealing
travelling-salesman
branch-and-bound
travelling-salesman-problem
-
Updated
Nov 7, 2020 - JavaScript
[IC-MII-UGR-2016-17] Práctica de algoritmos evolutivos (genéticos) | Resolución de problemas NP -> QAP
-
Updated
Apr 22, 2017 - JavaScript
Ant Colony Optimization meta heuristic algorithm visualization + solving Travel Sales man problem.
-
Updated
Jun 30, 2024 - JavaScript
Improve this page
Add a description, image, and links to the np-hard topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the np-hard topic, visit your repo's landing page and select "manage topics."