Set-Covering-Problem

UFRJ's Msc project for Combinatorial Optimization / Integer Programming course. This project aims to implement a decent solution to instances of the Set Covering Problem (SCP), mainly the ones disponibilized by Beasley's OR-Library.

Name		Name	Last commit message	Last commit date
ORLibrary_SPC		ORLibrary_SPC
.gitignore		.gitignore
LICENSE		LICENSE
README.md		README.md
set_covering.ipynb		set_covering.ipynb

Navigation Menu

Repository files navigation

Set-Covering-Problem

About

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

Set-Covering-Problem

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages