np-complete-problems

There are 0 repository under np-complete-problems topic.

agilot / satapps
Scala library for solving NP-hard probems
np-complete-problems np-hard z3 integer-programming sat-solver
Language:Scala 9
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...
rust linear-complexity np-complete-problems 3d-grid discrete-mathematics graph-algorithms graph-theory-algorithms grids hamiltonian-cycle loops optmization sculpture 3d-lattice
Language:Rust 9
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).
algorithm-analysis algorithms algorithms-and-data-structures approximation-algorithms branch-and-bound genetic-algorithm georgia-tech georgia-tech-masters minimum-vertex-cover np-complete np-complete-problems optimization simulated-annealing
Language:Python 6
R-Besson / strip-packing-cpp
Strip Packing Written in C++
algorithms np-complete np-complete-problems np-completeness packing packing-algorithm packing-algorithms strip-packing
Language:C++ 3
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).
3d discrete-mathematics graph-algorithms graph-theory-algorithms grids hamiltonian-cycle linear-complexity loops np-complete-problems rust sculpture
Language:Rust 2
R-Besson / strip-packing
Strip Packing Problem Visualizer
algorithms np-complete np-complete-problems packing-algorithms
Language:JavaScript 1
Edoar-do / MBASE-for-MHS-Problem
Minimal Hitting Set Solver with and without optimizations
algorithms-and-data-structures mhs np-complete-problems
Language:Python 0
johnnyasd12 / algorithms-stanford
Stanford Algorithms Courses in Coursera 課程筆記
algorithms data-structures divide-and-conquer dynamic-programming graph-search greedy-algorithms minimum-spanning-trees notes np-complete-problems randomized-algorithms shortest-path sorting-and-counting stanford-university
Language:Jupyter Notebook 0
kbecke05 / CSC349-Design-and-Analysis-of-Algorithms
Projects in Java and Python from class assignments
math-algorithms complexity divide-and-conquer-algorithms dynamic-programming exhaustive-search graph-algorithms graph-traversal-algorithms np-complete-problems
Language:Java 0
nicolasdesnoust-codingame / WinamaxSponsoredChallenge
Solution au challenge de Winamax de 2016 hébergé sur la plateforme Codingame.
coding-challenge backtracking np-complete-problems
Language:Java 0
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.
advertisements advertising approximability genetic-algorithm heuristic-algorithm marketing np-complete-problems optimization
Language:Jupyter Notebook
DhruvSrikanth / Algorithms
A collection of useful algorithms I am learning or have learnt and implemented to further develop my understanding!
algorithms data-structures graphs graph-algorithms optimization-algorithms np-complete-problems searching-algorithms sorting-algorithms multiplcation-algorithms dynamic-programming
Language:Python
pav-code / Algorithms
Graph, Greedy, Divide-and-Conquer and NP-Complete algorithms.
divide-and-conquer-algorithms graph-algorithms greedy-algorithms np-complete-problems
Language:Java