np-complete

Experimental minisat SAT solver reimplementation in Rust

An Ant Colony Optimization algorithm for the Traveling Salesman Problem

A java implementation of the famous Lin-Kernighan heuristics algorithm implemented for graphic (symmetric) TSP

Go (golang) bindings for Picosat, the satisfiability solver

Python solutions for Tim Roughgarden's 4 part books called Algorithms Illuminated

Graph coloring problem solved with Genetic Algorithm, Tabu Search and Simulated Annealing

Genetic algorithm to solve np-complete maximization problems. Originally intended for fantasy sports.

Problem Solving: A Practical Workbook

Exact and meta-heuristic algorithms for NP problems

The repo of "Exploring the Network of Real-World Passwords: Visualization and Estimation" in SecureComm 2017.

OptaPlanner wrappers for Python. Currently significantly slower than OptaPlanner in Java or Kotlin.

😆 Boolean formula satisfiability algorithms for JavaScript

Russian Doll Search for Computing Maximum Vertex Weight Hereditary Structures in Graphs. Now with OpenMP support.

Generalizations on backtracking algorithms (w or w/o recursion). They can use whatever data-structures and heuristic functions.

knapsack - A fast solver for the 0/1-knapsack problem with multiple knapsacks

演算法筆記

Explore different algorithms for Maximum 0-1 Knapsack

Implementation and Evaluation of "Genetic" and "Simulated Annealing" algorithms for Extended version of Travelling Salesman Problem.

Approximation Algorithm for the NP-Complete problem of finding a vertex cover of minimum weight in a graph with weighted vertices. Guarantees an answers at most 2 times the optimal minimum weighted vertex cover

n-Queens [Completion] problem solver implemented as multithreaded randomized non-recursive backtracking algorithm with dam-pruning

In MWVCP, a member of np-complete family, it is required to find the vertex cover of a given graph such that the sum of the weights of the nodes is the minimum. A vertex cover of a graph is “a set of vertices such that each edge of the graph is incident to at least one vertex of the set”.

Datasets

Solution finder for a popular mobile game "Flow Free". Solution for this game is in NP-Complete. Derived a polynomial time reduction algorithm to reduce the problem to satisfiability problem.

Creates and solves an arbitrarily shaped Rikudo Puzzle using a SAT-solver.

Car Sequencing Problem solved by constraint programming approach and Choco Solver.

This class will create the knapsack, the items, and implement the three strategies to it to find their different execution times.

Joint (Maths & Computer Science) Senior Honours project on Graph Homomorphisms.

analyzer of selected task scheduling heuristics.

Fundamental Concepts of Computer Science (Draft) - by James Arvo