https://github.com/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.
https://github.com/renatomaynard/branch-and-bound-for-multiple-knapsack-problem
branch-and-bound combinatorial-optimization heuristic-algorithms knapsack-problem multiple-knapsack-problem np-hard operations-research optimization-algorithms python quadratic-knapsack
Last synced: 6 months ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/renatomaynard/branch-and-bound-for-multiple-knapsack-problem
- Owner: RenatoMaynard
- License: mit
- Created: 2025-03-14T23:56:32.000Z (7 months ago)
- Default Branch: main
- Last Pushed: 2025-03-15T00:37:57.000Z (7 months ago)
- Last Synced: 2025-03-31T12:01:39.886Z (6 months ago)
- Topics: branch-and-bound, combinatorial-optimization, heuristic-algorithms, knapsack-problem, multiple-knapsack-problem, np-hard, operations-research, optimization-algorithms, python, quadratic-knapsack
- Language: Python
- Homepage:
- Size: 24.4 KB
- Stars: 6
- Watchers: 1
- Forks: 0
- Open Issues: 0