Tools to compute the minimum semidefinite rank of a simple undirected graph
-
Updated
Apr 16, 2024 - Python
Tools to compute the minimum semidefinite rank of a simple undirected graph
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.
Discrete Optimization course on Coursera - Assignments code
A simple feedback vertex set solver heavily employing reduction techniques.
collections of examples of gumbel softmax tricks in optimization & deep learning
Discrete Optimization Algorithms
Homework of course "Discrete Optimization"
This project is an application of the studies made during the course of 'Algorithms and Models for the Discrete Optimization'
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 greedy algorithm for cleaning a data file.
Sort of "Integer" Quadratic Programming Program in Portfolio Construction
A tool to help you decide what to wear and when. It takes into consideration things like matching-apparels, laundry requirements, variety in the dressing etc. while devising a dressing-schedule.
Semestral work for subject Discrete optimization at FRI UNIZA
Computing bounds for ranks and TI qualification of the DPC 2023 Tour 3 with Integer Programming
Two Mixed Integer Programs for cleaning a data file.
An example can be where one travels to Dubai and has an unlimited card, but the only issue is that economy and business class only allows 48Kgs 🧳 non negotiable per customer in the time of coronavirus 2021.
Add a description, image, and links to the discrete-optimization topic page so that developers can more easily learn about it.
To associate your repository with the discrete-optimization topic, visit your repo's landing page and select "manage topics."