Tools to compute the minimum semidefinite rank of a simple undirected graph

This project is an application of the studies made during the course of 'Algorithms and Models for the Discrete Optimization'

A greedy algorithm for cleaning a data file.

Exploring explores different ways of solving the combinatorial problem of choosing which time series sum together to give an overall time series of interest.

A simple feedback vertex set solver heavily employing reduction techniques.

The Teleportation Mechanism is an algorithm-extension, which can be applied to many optimization algorithms.

collections of examples of gumbel softmax tricks in optimization & deep learning

Discrete Optimization course on Coursera - Assignments code

Frequency Based Pruning (FBP) is a feature selection algorithm based upon maximizing the Youden J statistic. FBP intelligently enumerates through combinations of features, using the frequency of smaller patterns to prune away large regions of the solution space.

second cycle first semester

Fish School Search Algorithm python3 implementation

Discrete Optimization Algorithms

This Discrete Optimization project presents an integer programming model to optimize the scheduling of exams during the examination period while minimizing the penalties associated with conflicting exams.

Sort of "Integer" Quadratic Programming Program in Portfolio Construction

A greedy algorithm to find the combination of features that maximized the Younden J statistic.

Job Sequencing And Tool Switching

Locally Sensitive Data Mule Scheduling Problem (W.I.P.)

This is my thesis work for the Bachelor's degree in Physics. / Este es mi trabajo de titulación para la Licenciatura en Física.