RenatoMaynard / Branch-and-Bound-for-Multiple-Knapsack-Problem
View external linksLinks

A Python implementation of a branch-and-bound approach (plus a simple greedy heuristic) to solve a variation of the multiple knapsack problem where items have both individual and pairwise benefits.
20Mar 15, 2025Updated 10 months ago

Alternatives and similar repositories for Branch-and-Bound-for-Multiple-Knapsack-Problem

Users that are interested in Branch-and-Bound-for-Multiple-Knapsack-Problem are comparing it to the libraries listed below

Sorting:

Are these results useful?