BCP done in Gurobi solver. This is a modified version of BCP. It is set to maximie value of items that we throw insted of maximising bin coverage. All in all it's more like a Backpack Problem for multiple backpacks but to make it an actual BCP you just need to change objective to maximise summarised size.
-
Notifications
You must be signed in to change notification settings - Fork 0
zapalke/Gurobipy-bin-covering-problem
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
BCP done in Python and Gurobi solver.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published