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

Exact and meta-heuristic algorithms for NP problems

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

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

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

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

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

solving knapsack problem using Ant Colony Optimization (ACO) algorithm

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

ALMA—MWX2SAT Solver

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

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

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.

🔱 Learning to Branch in Mixed Integer Linear Programming with Neural Networks

Sabanci University CS301 - Algorithms Course Project

Implementation of three fundamental algorithms in graph theory and Boolean logic: Satisfiability (SAT), Clique, and Independent Set. Each problem is addressed using various optimization and search techniques.

CAPABLANCA-SAT Solver