This repository was created for the subject of Computer Theory. The propose of this subject is to improve your skills to solve the 0-1 knapsack problem of different ways. The techniques used were Dynamic Programing and two metaheuristics (which are GRASP and TABU search).

Adapted GRASP algorithm developed by researchers from the Informatics Center of the Federal University of Pernambuco - UFPE to optimize Deep Learning architectures for tabular data classification.

Project for Algorithmic Methods for Mathematical Modeling class

This project together with mrcp document explain process of develop and analitic of MRCP or Maximum Ratio Clique Problem. Wich starting from a graph with nodes and different weights of these, the algorithm will find an aproximate optimal solution, forming a clique or a complete sub-graph with maximum ratio.

This is the code of a metaheuristic algorithm (GRASP) for the Maximum Diversity Problem (MDP).

A solution based on the Maximum Independent Set to solve the Maximum Clique using the GRASP metaheuristic.

Repository contaning all code to render a GRASP explanatory using Manim Community library.