Collection of classes and functions to allow 2D/3D path generation with heuristic algorithms such as A*, Theta* and LazyTheta* and ROS Interfaces

This code is to solve traveling salesman problem by using simulated annealing meta heuristic.

A decision support system for the two-dimensional strip packing problem

Testing a bunch of graph minor embedding heuristics.

Powerful genetic alogrithm library for C++

A sliding block puzzle, whose solution is found using A* Search.

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

MSc Thesis at FER led by Lea Skorin-Kapov, PhD and Nina Skorin-Kapov, PhD

An application in c++ to solve the Travelling Salesman Problem using the Ant Colony System

Travelling salesman problem optimization visualizer

light_or is a tool that help you develop Operational Research algorithms to solve combinatorial optimization problems.

C++ implementation of Arboreal-Ants(https://github.com/shivamg13/Arboreal-Ants)

The minimal elements of the prime numbers which are > b written in the positional numeral system with radix b, as digit strings under the subsequence ordering, for 2 ≤ b ≤ 36

Laboratory of Smart Computing and Optimization Summer Practice

Solving sustainable Capacitated Vehicle Routing Problem (CVRP) Optimization problem using C++ and local search metaheuristics algorithm

Generic C++ implementation of A* algorithm (header only). Features: Fully customizable internal data structures, step-by-step execution and beam search support.

An AI of hexagon gobang, using mcts

"The classic 'N-Queens problem' is tackled using a variety of advanced techniques such as nested loops, heuristics, backtracking, genetic algorithms, and local search algorithms."

Proyecto con aplicación de Heurísticas (Modelo Kruskal) realizado en 2013

An analysis of a NP-Complete Graph Colouring problem 3-Colourability and an approximate algorithm analysis that solves 3-COL.