A challenge to make this basic closest-strings program more efficient.

Application Data Distribution in Edge Computing

A program that breaks cycles in undirected and directed graphs (with and without weights), that is, to find the minimum feedback arc set in given graphs.

Ant Colony Optimization algorithm solving Google HashCode 2020 online elimination problem

Baldor: Minimum Vertex Cover Solver

Algorithm analysis of NP-Hard problem called Maximum Set Packing.

Deep learning and Reinforcement Learning for solving NP-Hard combinatorial problems like TSP.

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.

A test for the my Genetic Library. The Traveling Salesman problem solved with Genetic Algorithms.

A Crystal port of @mak-it's 2D Bin Packing solver, using the Maximal Rectangles Algorithm.

Explore different algorithms for Maximum 0-1 Knapsack

Identical machines scheduling, minimizing the makespan

Algorithmic approximation to a 4D travelling salesman problem

This repository contains a Python implementation of a color coding method for the problem of finding a subtree with k vertices in a given graph.

Traveling Salesman Problem, FEUP-DA project

This repo contains the implementation of an heuristic to solve the Traveling Tournament Problem (TTP), as well as the implementation of the Meta-heuristics' algorithm Iterated Local Search (ILS) satisfying the predefined contraints of the NP-hard problem.

Heuristics and metaheuristics for enhancing Run-Length Encoding in a database

The Logistics Optimizer tackles the NP-hard Container Terminal Space Allocation and Scheduling Problem using an Enhanced Cuckoo Search Algorithm with Gaussian Mixture Clustering. This approach maximizes space utilization and minimizes costs, improving efficiency in resource allocation and scheduling for logistics operations.