Skip to content
#

quadratic-knapsack

Star

Here is 1 public repository matching this topic...

RenatoMaynard / Branch-and-Bound-for-Multiple-Knapsack-Problem

Sponsor
Star 18

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.

python np-hard operations-research knapsack-problem optimization-algorithms branch-and-bound combinatorial-optimization heuristic-algorithms multiple-knapsack-problem quadratic-knapsack
  • Updated Mar 15, 2025
  • Python

Improve this page

Add a description, image, and links to the quadratic-knapsack topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the quadratic-knapsack topic, visit your repo's landing page and select "manage topics."

Learn more