Rule covering for interpretation and boosting
-
Updated
Apr 20, 2021 - HTML
Rule covering for interpretation and boosting
A solver for the (Unicost) Set Covering Problem
Implementation of different techniques to solve the Set Covering Problem (SCP).
Minimal hitting set solver in Python
An algorithm to help knock out your non-major graduation requirements
Multi-Objective Discrete Optimization Instance Library
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
A simple C++ library for set covering problem instances made available in OR-Library.
Health Care Operations Management Problems: AMPL
This project is a set covering problem for unmanned aerial vehicle (UAV) to cover a set of targets. The problem is formulated as a mixed integer linear programming (MILP) model and solved by Gurobi solver.
Ant-colony optimisation algorithms for set-covering
22-1 산업시스템공학과 종합설계
Set cover problem with exact method using bitmask DP and approximation approach using LP
Material, laboratories and project related to "Computational Intelligence" course of A.Y. 2023/2024 at PoliTO
Set Covering Problem - Investigación de Operaciones ICI4144
Solving the set covering problem in C using heuristic optimization
This repository contains algorithms created to solve certain problems. The algorithms where developed in the context of completing a university course.
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."