Derivative-Free Global Optimization Algorithm (C++, Python binding) - Continuous, Discrete, TSP, NLS, MINLP

BCP-MAPF – branch-and-cut-and-price for multi-agent path finding

Exact and approximate solvers for minimum-cost-flow problems in bi-directed graphs.

Nutmeg – a MIP and CP branch-and-check solver

Discrete Asian Option Pricing for GPUs

Knapsack, Graph Coloring, Vehicle Routing Problems of Discrete Optimization Course from Master of Computer Engineering Department in Istanbul Technical University

Optimization of black box functions defined on bit vectors

Our final project for Deep Learning in Discrete Optimization taught by Bill Cook. We developed an ML-based branching rule for solving Protein Design problems in Weighted Constraint Satisfaction form.

Travelling salesman problem optimization visualizer

BCP2-MAPF – branch-and-cut-and-price for multi-agent path finding, version 2

CP (constraint programming) problems solved mainly in Gecode library

Différents snippets liés à l'optimisation discrète.

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.

A simple feedback vertex set solver heavily employing reduction techniques.

A greedy algorithm for cleaning a data file.

Discrete Optimization Algorithms

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

C++ implementation of the NoRELAX methods presented in Continuous Relaxation of MAP Inference: A Nonconvex Perspective (CVPR 2018)

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.