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

JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RenatoMaynard%2FBranch-and-Bound-for-Multiple-Knapsack-Problem

Topics: branch-and-bound, combinatorial-optimization, heuristic-algorithms, knapsack-problem, multiple-knapsack-problem, np-hard, operations-research, optimization-algorithms, python, quadratic-knapsack

Funding Links https://github.com/sponsors/RenatoMaynard

• Files
• Readme
• Dependencies