Branch-and-Bound-for-Multiple-Knapsack-Problem
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.
// repository documentation
Was this content helpful?
(0 ratings)