-
Updated
Feb 3, 2017
np-hard
Here are 113 public repositories matching this topic...
[IC-MII-UGR-2016-17] Práctica de algoritmos evolutivos (genéticos) | Resolución de problemas NP -> QAP
-
Updated
Apr 22, 2017 - JavaScript
A particle swarm optimization algorithm implementation with simultaneous pickup and drop for medicines distribution management.
-
Updated
May 1, 2017 - Java
Explore different algorithms for Maximum 0-1 Knapsack
-
Updated
May 8, 2017 - Java
A Certifier algorithm to check a particular solution to the NP-Complete 3-Sat problem
-
Updated
May 18, 2017 - Java
Finds the optimal schedule for a DAG (NP-Hard problem) using an A* search. Features pruning and bound techniques along side an interactive GUI and parallel processing. SOFTENG306 (A-)
-
Updated
Aug 31, 2017 - Java
C++ algorithm to solve(or try to solve) the clique problem
-
Updated
Sep 1, 2017 - C++
A greedy approximation implementation of NP-hard problem.
-
Updated
Sep 24, 2017 - Java
Ocado cubing algorithms for GreatUniHack 2017.
-
Updated
Nov 15, 2017 - Kotlin
Comparison of meta-heuristics in QAP problem [Metaheuristics and Bio-inspired Computing] [studies]
-
Updated
Dec 13, 2017 - C#
-
Updated
Jan 13, 2018 - Rust
Go (golang) bindings for Picosat, the satisfiability solver
-
Updated
Feb 18, 2018 - C
genetic algorithm optimization in Go
-
Updated
Feb 26, 2018 - Go
Optimized Delegated Byzantine Fault Tolerance
-
Updated
Mar 5, 2018 - C++
A test for the my Genetic Library. The Traveling Salesman problem solved with Genetic Algorithms.
-
Updated
Jun 12, 2018 - C#
Deep learning and Reinforcement Learning for solving NP-Hard combinatorial problems like TSP.
-
Updated
Jul 5, 2018
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."