np-complete-problems
There are 13 repositories under np-complete-problems topic.
agilot/satapps
Scala library for solving NP-hard probems
discocube/weaver
Algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for graphs with over 8 billion vertices). Discocube graphs are 3-dimensional grid graphs derived from: a polycube of an octahedron | a Hauy construction of an octahedron with cubes as identical building blocks...
andrea-covre/Minimum-Vertex-Cover
With this project we researched, implemented and analyzed different algorithms to effectively and efficiently solve an NP-Complete problem such as the Minimum Vertex Cover (MVC).
R-Besson/strip-packing-cpp
Strip Packing Written in C++
discocube/weave_old
An algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for over graphs with 1 billion vertices).
R-Besson/strip-packing
Strip Packing Problem Visualizer
Edoar-do/MBASE-for-MHS-Problem
Minimal Hitting Set Solver with and without optimizations
johnnyasd12/algorithms-stanford
Stanford Algorithms Courses in Coursera 課程筆記
kbecke05/CSC349-Design-and-Analysis-of-Algorithms
Projects in Java and Python from class assignments
nicolasdesnoust-codingame/WinamaxSponsoredChallenge
Solution au challenge de Winamax de 2016 hébergé sur la plateforme Codingame.
alvaroseco/Using-genetic-algorithms-for-advertising-campaigns
This repository contains the files related to the paper 'Using genetic algorithms for advertising campaigns', carried out by Álvaro Seco, Natalia López and Fernando Rubio.
DhruvSrikanth/Algorithms
A collection of useful algorithms I am learning or have learnt and implemented to further develop my understanding!
pav-code/Algorithms
Graph, Greedy, Divide-and-Conquer and NP-Complete algorithms.