Minimal hitting set solver in Python
An algorithm to help knock out your non-major graduation requirements
Solution for the set-cover assignments of the Coursera course "Discrete Optimization"
Classical AI approaches to NP-Hard Problems. Brute Force -> Hybrid Genetic Algorithms and more
This repository contains algorithms created to solve certain problems. The algorithms where developed in the context of completing a university course.
Este proyecto implementa un algoritmo de Simulated Annealing para resolver el Set Covering Problem representado como un grafo.
This is an algorithm implementation that solves the Set Covering Problem. It 's due to an assignment for the "Pesquisa Operacional" class at UFMG.
Algorithmic solvers for popular NYT word puzzles
Add a description, image, and links to the set-covering-problem topic page so that developers can more easily learn about it.
To associate your repository with the set-covering-problem topic, visit your repo's landing page and select "manage topics."