np-complete

OptaPy is an AI constraint solver for Python to optimize planning and scheduling problems.

Na Rinha de Algoritmos você deve utilizar suas habilidades para a criação de algoritmos eficientes para resolver problemas!

Experimental minisat SAT solver reimplementation in Rust

An Ant Colony Optimization algorithm for the Traveling Salesman Problem

A command line tool for computational hard problems and their reductions

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

Implementation of classical problems in Computer Science in the Answer Set Solving dialect of Clingo.

The Swiss Army Knife of Applied Quantum Technology (Experimental Tech)

Exact and meta-heuristic algorithms for NP problems

🔎 wheeler graph recognition algorithm, visualization and generation

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

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

Go (golang) bindings for Picosat, the satisfiability solver

a collection of benchmarks (in DIMACS format) for various NP-Complete problems

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

Comprehensive 2023-2024 study material for Algorithms & Complexity, including lecture notes, graph algorithms, shortest paths, minimum spanning trees, dynamic programming, greedy algorithms, NP problems, and exercises. Organized by chapters with supplementary PDFs and personal notes (Algorithms and Complexity, UNIWA).

A Lean library for descriptive complexity: NP-completeness and the polynomial hierarchy by first-order reductions, stronger than polynomial-time (Karp) reductions. Machine-free Cook–Levin, all 21 Karp problems, on Mathlib's ModelTheory

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

A Reduced-order Binary Decision Diagram (RoBDD) SAT solver written in Rust