Elaborato di Ricerca Operativa. Implementazione di un algoritmo Greedy, Local Search e Tabu Searc per problemi di set covering di grandi dimensioni.
-
Notifications
You must be signed in to change notification settings - Fork 0
Project in Operational Research (Ricerca operativa), in collaboration with Alfonso Conte. Local Search Heuristic and Tabu Search Heuristic applied to medium and large scale Set Covering Problem, coded in Python.
DanieleFazzari/Operational_Research_Project_2022
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Project in Operational Research (Ricerca operativa), in collaboration with Alfonso Conte. Local Search Heuristic and Tabu Search Heuristic applied to medium and large scale Set Covering Problem, coded in Python.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published