Kiwi is a minimalist and extendable Constraint Programming (CP) solver.

Generation of Synthetic Populations Library

column generation implementation based on google or-tools for cutting stock problem

Self-guided tutorial on combinatorial optimization, the bin packing problem, and constructive heuristics, suitable for use as course assignments, or by self-directed learners.

simple Java implementation of nonogram solver based on constraint satisfaction programming using several heuristics

A new algorithm based on differential evolution for combinatorial optimization

Example programs for usage of the Chips-n-Salsa library

The W-Model, a tunable Black-Box Discrete Optimization Benchmarking (BB-DOB) problem, implemented for the BB-DOB@GECCO Workshop.

A computational exploration of combinatorial mathematics, aimed at solving the problem of counting all possible paths in an m x n grid using recursive and dynamic programming techniques with memoization for enhanced efficiency.

This Java program defines two functions, howSum and improvedHowSum, to find a combination of numbers that add up to a given target sum, using a simple recursive approach and a more efficient recursive approach with memoization, respectively.

A short Java-based project that explores the problem of determining if a target sum can be achieved using elements from a given array, employing both a basic recursive approach and an optimized version using memoization

Unraveling the Rainbow: can value-based methods schedule?

This is a proposal of VNS for the knapsack problem

This repository contains the Vehicle Routing Problem with Time Windows and Delivery Robots (VRPTWDR), inspired by the work of Chen et al. (2021). The project uses Java to implement an Adaptive Large Neighborhood Search (ALNS) heuristic for solving the problem and compares the performance with solutions obtained via the Gurobi optimizer.

The code for the paper: A Heuristic Initialized Stochastic Memetic Algorithm for MDPVRP With Interdependent Depot Operations (IEEE transactions on cybernetics, December 2017)

Code and experiment data from the paper: "On Fitness Landscape Analysis of Permutation Problems: From Distance Metrics to Mutation Operator Selection"

TheObersolver is a pre-release software designed to solve the Oberwolfach Problem.

My solution to the machine works problem.

A Data Structures & Algorithms assignment program that finds an optimised path through 1000 airports with the stipulation that there cannot be less than 150 km between sequential stops.

A fun little combinatorial search project of packing words into bins, to be implemented in Java 11.