Algorithms Specialization (Stanford-Coursera)
-
Updated
Apr 4, 2020 - Python
Algorithms Specialization (Stanford-Coursera)
Approximation and randomized algorithms - Assignment 01 - SAT
Solving a graph NP-problem using Sat-Solving (libz3) approach.
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.
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.
Compares an algorithm that solves the K-Clique problem exponentially with an algorithm that solves the polynomial transformation to SAT
My Edinburgh Napier University Honours Project: investigating the multi-objective Capacitated Vehicle Routing Problem with Time Windows (CVRPTW).
University project about time and space complexity of differents algorithms, data structure and NP problems
This Python program uses 2 main Artificial Intelligence Algorithms to solve the Best Vertex Cover Problem.
An efficient simulated annealing algorithm applied to the Minimum Vertex Cover Problem
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 .
Feasibility Intensive Genetic Algorithm (FIGA) for the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW)
NTUEE Algorithm 23Spring PA3
A recursive algorithm with backtracking in Java to solve the NP problem of SAT solving.
Flexible and modular framework for different NP-Problems with different solvers
Записките ми за упражнения по "Дизайн и анализ на алгоритми"
Add a description, image, and links to the np-problem topic page so that developers can more easily learn about it.
To associate your repository with the np-problem topic, visit your repo's landing page and select "manage topics."