C

combinatorial optimization

Proof checker for proof logging method using pseudo-Boolean reasoning for various combinatorial solving and optimization algorithms.

PhD project repository for algorithms and research on approximation-based heuristics for the Inventory Routing Problem and related topics.

RoundingSat: the pseudo-Boolean solver powered by proof complexity!

An elegant and efficient combinatorial programming language.

Formally verified proof checker for pseudo-Boolean reasoning for various combinatorial solving and optimization problems based on the CakeML ecosystem.

A C++ implementation of my novel optimisation method for open-shop scheduling with arbitrary constraints.

An implementation of optimisation heuristics for the TSP, designed to run in less than two seconds on 1000-cities input

The developed software project is optimized job-shop scheduling problem using lottery planning.

The epiGenetic Algorithm (epiGA), consists of a set of strategies, based on evolutionary computation, inspired in nature, especially in epigenetics, with the aim of solving complex combinatorial problems.

The epiGenetic Algorithm (epiGA), consists of a set of strategies, based on evolutionary computation, inspired in nature, especially in epigenetics, with the aim of solving complex combinatorial problems