Formulating the prioritisation question as a 'knapsack problem'
-
Updated
Mar 22, 2019 - Jupyter Notebook
Formulating the prioritisation question as a 'knapsack problem'
Quick try-out of (mostly Python) discrete optimization packages
Algorithms project based on the Coursera course by Pascal Van Hentenryck
Discrete Optimization course on Coursera - Assignments code
A simple feedback vertex set solver heavily employing reduction techniques.
Branch-and-Bound with Decision Diagrams + Caching
collections of examples of gumbel softmax tricks in optimization & deep learning
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.
[CVPR 2019] Official Matlab implementation of OSD: Unsupervised image matching and object discovery as optimization.
Choco solver Kotlin extensions
This project is an application of the studies made during the course of 'Algorithms and Models for the Discrete Optimization'
Project done under the supervision of Professor Friedrich Eisenbrand and Jana Cslovjecsek at EPFL, Lausanne, Switzerland.
University of Melbourne's Discrete Optimization Coursera course
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.
Travelling salesman problem optimization visualizer
CMake build system for Blossom-V with patches
Discrete Trust-aware Matrix Factorization for Fast Recommendation. IJCAI, 2019.
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."