Projects with this topic
-
A C++ library to model and solve mixed-integer programs, that allows to implement Relax-and-Fix based heuristics and generalizations in a few lines of codes. Switch between Relax-and-Fix and generalizations with one parameter. Switch between solvers with one parameter. The heuristic is described in Joncour, C., et al. "Generalized Relax-and-Fix heuristic." Computers & Operations Research (2023).
Updated -
Implementation of UCS on Romania to find shortest distance from Arad to Bucharest based on best-first search algorithm. It uses a dictionary that stores current city mapped to (parent city, current best distance), and frontier is a priority queue to process nodes containing (node id, current city, priority value).
Updated -
Comparison of minmax heuristics for a Pylos game algorithm
Updated -
A new optimisation method for open-shop scheduling with arbitrary constraints based on simulated annealing and genetic algorithms
Updated -
C# implementation of sliding puzzle game using WPF and .NET Core.
Updated