RenatoMaynard/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.

Language: Python - Size: 24.4 KB - Last synced at: 8 days ago - Pushed at: 2 months ago - Stars: 18 - Forks: 0