Solution au challenge de Winamax de 2016 hébergé sur la plateforme Codingame.

Stanford Algorithms Courses in Coursera 課程筆記

Graph, Greedy, Divide-and-Conquer and NP-Complete algorithms.

Minimal Hitting Set Solver with and without optimizations

Projects in Java and Python from class assignments

A collection of useful algorithms I am learning or have learnt and implemented to further develop my understanding!

An implementation of a fully custom multithreaded HTTP server that allows for the solving of N-Puzzle problems remotely through a web client interface

This repository contains the files related to the paper 'Using genetic algorithms for advertising campaigns', carried out by Álvaro Seco, Natalia López and Fernando Rubio.

Strip Packing Problem Visualizer

An algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for over graphs with 1 billion vertices).

Strip Packing Written in C++

With this project we researched, implemented and analyzed different algorithms to effectively and efficiently solve an NP-Complete problem such as the Minimum Vertex Cover (MVC).

Scala library for solving NP-hard probems

Algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for graphs with over 8 billion vertices). Discocube graphs are 3-dimensional grid graphs derived from: a polycube of an octahedron | a Hauy construction of an octahedron with cubes as identical building blocks...