np-problem

There are 0 repository under np-problem topic.

• c410-f3r / mop

  Flexible and modular framework for different NP-Problems with different solvers

  aiframeworkheuristicsmetaheuristicsnp-problemrustsolver
  Language:Rust 20

• hamidgasmi / training.computerscience.algorithms-datastructures

  algorithms-and-data-structuresgreedy-algorithmsdivide-and-conquerdynamic-programminggraph-algorithmsnp-completelinked-listtree-structureheapsort-algorithmbig-odisjoint-setsnp-problemhashingbinary-search-tree
  Language:Python 14

• taylorc1009 / FIGA-CVRPTW

  Feasibility Intensive Genetic Algorithm (FIGA) for the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW)

  aiartificial-intelligencecapacitated-vehicle-routing-problemcvrptwevolutionary-algorithmevolutionary-algorithmsgenetic-algorithmgenetic-algorithmsnp-hardnp-problempythonpython3solomon-cvrptwvehicle-routing-problemvrpvrptw
  Language:Python 6

• 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 .

  metaheuristic-algorithmsnp-problempythontsp-problemtsp-solver
  Language:Python 5

• toduko / design-and-analysis-of-algorithms

  Записките ми за упражнения по "Дизайн и анализ на алгоритми"

  algorithmsasymptotic-analysisgraph-theorydynamic-programmingsortinglower-boundscomplexitynp-completenessnp-hardnp-problem
  Language:TeX 5

• 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.

  np-problembacktracking-algorithmsubset-sumsubset-sum-solveralgorithms-and-data-structuresalgorithmscompetitive-programming
  Language:C 4

• taylorc1009 / Honours-Project

  My Edinburgh Napier University Honours Project: investigating the multi-objective Capacitated Vehicle Routing Problem with Time Windows (CVRPTW).

  pythongenetic-algorithmgenetic-algorithmsvehicle-routing-problemcapacitated-vehicle-routing-problemcvrptwsolomon-cvrptwnp-hardnp-problempython3vrptwvrpaiartificial-intelligenceevolutionary-algorithmevolutionary-algorithms
  Language:Python 4

• IliesChibane / Projet-Algo

  University project about time and space complexity of differents algorithms, data structure and NP problems

  algorithms-and-data-structurescomplexitycppnp-problem
  Language:TeX 3

• lexust1 / algorithms-stanford

  Algorithms Specialization (Stanford-Coursera)

  algorithmsdatastructuresgraphsdivide-and-conquerrecursiondynamic-programmingnp-problem
  Language:Python 1

• shawntsai0312 / NTUEE_ALGORITHM_23SPRING_PA3

  NTUEE Algorithm 23Spring PA3

  algorithmcppgraph-algorithmsnp-problemntuntueecycle-breaker
  Language:C++ 1

• 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

  travelling-salesman-problemcppnp-problemoptimalisationcplusplus-17
  Language:C++ 0

• h-escoffier / Anneal-ize_the_Vertex

  An efficient simulated annealing algorithm applied to the Minimum Vertex Cover Problem

  minimum-vertex-covernp-problemsimulated-annealing-algorithm
  Language:Python 0

• hstoklosa / sat-solver

  A recursive algorithm with backtracking in Java to solve the NP problem of SAT solving.

  java-algorithmnp-problemsat-solver
  Language:Java 0

• K1ntus / Computational-Complexity

  Solving a graph NP-problem using Sat-Solving (libz3) approach.

  libz3sat-solvernp-problemgraph
  Language:C 0

• 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

  np-problemsatkclique-problem
  Language:Java 0

• 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.

  partitioning-algorithmsalgorithmsnp-hardnp-problemnp-algorithmperfect-matchingscourse-project
  Language:Java 0

• Ziad235 / Best-Vertex-Cover

  This Python program uses 2 main Artificial Intelligence Algorithms to solve the Best Vertex Cover Problem.

  artificial-intelligencenp-problem
  Language:Python 0

• arruw / fri-1920-ara-01-sat

  Approximation and randomized algorithms - Assignment 01 - SAT

  sat-solvingapproximation-algorithmsnp-problemvertex-covercliquen-queensdominant-sets
  Language:Python

• Nerocraft4 / NQueens-CPP

  N Queens problem with C++

  benchmarkingcppn-queensnp-problemoptimization
  Language:C++

• VGriga / QUBO-problems

  np-problemoptimizationqubo-matrix
  Language:Jupyter Notebook