np-problem
There are 20 repositories under np-problem topic.
c410-f3r/mop
Flexible and modular framework for different NP-Problems with different solvers
toduko/design-and-analysis-of-algorithms
Записките ми за упражнения по "Дизайн и анализ на алгоритми"
taylorc1009/FIGA-CVRPTW
Feasibility Intensive Genetic Algorithm (FIGA) for the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW)
taylorc1009/Honours-Project
My Edinburgh Napier University Honours Project: investigating the multi-objective Capacitated Vehicle Routing Problem with Time Windows (CVRPTW).
BoutainaELYAZIJI/TSP_project
The traveling salesman problem (TSP) is a well-known problem in theoretical computer science and operations research. The standard version of the TSP is a hard problem and belongs to the NP-Hard class. In this project, I build an application to implement the TSP by the dynamic approach and the GVNS approach .
parthnan/SubsetSum-BacktrackAlgorithm
Solving the popular NP problem, The Subset Sum Problem, with an Amortized O(n) algorithm based on Recursive Backtracking. The Algorithm stood second fastest in the organized Intra-University competition.
IliesChibane/Projet-Algo
University project about time and space complexity of differents algorithms, data structure and NP problems
h-escoffier/Anneal-ize_the_Vertex
An efficient simulated annealing algorithm applied to the Minimum Vertex Cover Problem
hstoklosa/sat-solver
A recursive algorithm with backtracking in Java to solve the NP problem of SAT solving.
lexust1/algorithms-stanford
Algorithms Specialization (Stanford-Coursera)
shawntsai0312/NTUEE_ALGORITHM_23SPRING_PA3
NTUEE Algorithm 23Spring PA3
AdamPiszczek/traveling-salesman-problem
the problem of finding a cycle in a graph that contains all vertices (each exactly once) and has the lowest possible cost
K1ntus/Computational-Complexity
Solving a graph NP-problem using Sat-Solving (libz3) approach.
sabidea23/K-Clique-to-SAT
Compares an algorithm that solves the K-Clique problem exponentially with an algorithm that solves the polynomial transformation to SAT
spolo96/Partition-Into-Perfect-Matchings-Graph
An approach about the NP-Hard problem: Partition Into Perfect Matchings, in which I worked in the class of Complexity and Algorithms, in Universidad del Norte, which I wanted to share with the world.
Ziad235/Best-Vertex-Cover
This Python program uses 2 main Artificial Intelligence Algorithms to solve the Best Vertex Cover Problem.
arruw/fri-1920-ara-01-sat
Approximation and randomized algorithms - Assignment 01 - SAT
Nerocraft4/NQueens-CPP
N Queens problem with C++