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

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

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

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

Discrete Optimization Algorithms

Discrete optimization library

Optimization of black box functions defined on bit vectors

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

A greedy algorithm for cleaning a data file.

A simple feedback vertex set solver heavily employing reduction techniques.

CP (constraint programming) problems solved mainly in Gecode library

Travelling salesman problem optimization visualizer

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.

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.

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

Two Mixed Integer Programs for cleaning a data file.

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

Algorithms for discrete optimisation