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

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

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

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

An Ant Colony Optimization algorithm for the Traveling Salesman Problem

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

Experimental minisat SAT solver reimplementation in Rust

The Swiss Army Knife of Applied Quantum Technology

Go (golang) bindings for Picosat, the satisfiability solver

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

Exact and meta-heuristic algorithms for NP problems

https://www.coursera.org/learn/algorithms-npcomplete

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

A Certifier algorithm to check a particular solution to the NP-Complete 3-Sat problem

📝 Solutions to the exercise sessions

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

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

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

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