Multi-Objective Discrete Optimization Instance Library
julia
assignment-problem
multiobjective-optimization
knapsack
set-covering-problem
instances
set-packing
random-instances
-
Updated
Feb 1, 2018 - Julia
Multi-Objective Discrete Optimization Instance Library
well-known optimization algorithms on the SPP for pedagogical purposes
This is an implementation of a greedy algorithm for a variation of the Set Packing problem.
Algorithm analysis of NP-Hard problem called Maximum Set Packing.
Add a description, image, and links to the set-packing topic page so that developers can more easily learn about it.
To associate your repository with the set-packing topic, visit your repo's landing page and select "manage topics."