22-1 산업시스템공학과 종합설계
-
Updated
Jun 10, 2022 - Jupyter Notebook
22-1 산업시스템공학과 종합설계
Implementation of different techniques to solve the Set Covering Problem (SCP).
Multi-Objective Discrete Optimization Instance Library
Minimal hitting set solver in Python
A solver for the (Unicost) Set Covering Problem
Rule covering for interpretation and boosting
Classical AI approaches to NP-Hard Problems. Brute Force -> Hybrid Genetic Algorithms and more
An algorithm to help knock out your non-major graduation requirements
Solution for the set-cover assignments of the Coursera course "Discrete Optimization"
Material, laboratories and project related to "Computational Intelligence" course of A.Y. 2023/2024 at PoliTO
Set Covering Problem - Investigación de Operaciones ICI4144
Set cover problem with exact method using bitmask DP and approximation approach using LP
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.
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.
Projects of "Bio Inspired Computing" Course - University of Tehran - Spring 2024
A simple C++ library for set covering problem instances made available in OR-Library.
This is an algorithm implementation that solves the Set Covering Problem. It 's due to an assignment for the "Pesquisa Operacional" class at UFMG.
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."