Solving the set covering problem in C using heuristic optimization
-
Updated
May 18, 2016 - C
Solving the set covering problem in C using heuristic optimization
Project to learn and understand backtracking algorithms with the goal to solve a crossword puzzle
Project focuses on optimised implementation of Backtracking and Forward Checking algorithms in order to find all solutions of the N Queens problem
Solving the closest string problem using swarm intelligence
Automatically exported from code.google.com/p/genetic-algorithms-for-puzzle-15
Genetic Algorithm for Machinery Usage Scheduling
Repository for OMA assignment 2017-2018 for the master degree course in Software Engineer of Polytechnic of Turin.
FPBH: A Feasibility Pump based Heuristic for Multi-objective Mixed Integer Linear Programming
Extreme Tic Tac toe (AI) implemented using Python
Online Qualification Round of Google Hash Code 2018
Heuristic Optimization using Pytorch
Estimation of distribution algorithm (Octave implementation)
Projects of Course
Simulated Annealing algorithm for SALBP-2 problem.
Heuristics for cardinality constrained portfolio optimisation
A Distributed particle swarm optimization (PSO) implementation in erlang
MPI parallel implementation of genetic algorithm based Rubik's cube solver.
Traveling Salesman Problem playground
Google Hash Code 2019
Add a description, image, and links to the heuristic-optimization topic page so that developers can more easily learn about it.
To associate your repository with the heuristic-optimization topic, visit your repo's landing page and select "manage topics."