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

• UpdatedOct 2, 2023
• Java

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

• UpdatedMar 3, 2024
• Python

Experimental minisat SAT solver reimplementation in Rust

• UpdatedAug 10, 2019
• Rust

An Ant Colony Optimization algorithm for the Traveling Salesman Problem

• UpdatedNov 18, 2019
• MATLAB

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

• UpdatedFeb 22, 2024
• Java

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

• UpdatedFeb 21, 2025
• Python

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

• UpdatedApr 17, 2018
• C++

Exact and meta-heuristic algorithms for NP problems

• UpdatedOct 28, 2019
• Python

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

• UpdatedAug 16, 2020
• Jupyter Notebook

Go (golang) bindings for Picosat, the satisfiability solver

• UpdatedFeb 18, 2018
• C

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

• UpdatedAug 14, 2023
• Python

🔎 wheeler graph recognition algorithm, visualization and generation

• UpdatedJul 7, 2023
• C++

• UpdatedJan 18, 2025
• Python

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

• UpdatedDec 19, 2022
• TeX

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

• UpdatedMay 14, 2017
• Python

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

• UpdatedJan 12, 2019
• Java

https://portfolio.raghavkumar.co.in/collegeschduler Creates a college schedule using ant-colony optimisation to perform graph colouring. This was my sem 4 Software Engineering project

• UpdatedJun 23, 2024
• TypeScript

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

• UpdatedSep 13, 2024
• Rust

Problem Solving: A Practical Workbook

• UpdatedNov 8, 2019
• Jupyter Notebook

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

• UpdatedJan 11, 2023
• Python