25 results for “topic:np-problem”
No description provided.
Записките ми за упражнения по "Дизайн и анализ на алгоритми"
Feasibility Intensive Genetic Algorithm (FIGA) for the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW)
My Edinburgh Napier University Honours Project: investigating the multi-objective Capacitated Vehicle Routing Problem with Time Windows (CVRPTW).
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 .
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.
Position-Candidate-Hypothesis (PCH) is a theoretical paradigm for structural-statistical analysis of NP-complete problems.
University project about time and space complexity of differents algorithms, data structure and NP problems
An efficient simulated annealing algorithm applied to the Minimum Vertex Cover Problem
NTUEE Algorithm 23Spring PA3
Algorithms Specialization (Stanford-Coursera)
A recursive algorithm with backtracking in Java to solve the NP problem of SAT solving.
Compares an algorithm that solves the K-Clique problem exponentially with an algorithm that solves the polynomial transformation to SAT
An Algorithmic Approach to Solve the Grouping Problem, BSc Thesis
No description provided.
Datasets - Partitioning at scale
Datasets - Packing at scale
Datasets - Partitioning at scale
Approximation and randomized algorithms - Assignment 01 - SAT
the problem of finding a cycle in a graph that contains all vertices (each exactly once) and has the lowest possible cost
Solving a graph NP-problem using Sat-Solving (libz3) approach.
Semestrální práce KIV/PT - Programovací Techniky
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.
This Python program uses 2 main Artificial Intelligence Algorithms to solve the Best Vertex Cover Problem.
N Queens problem with C++