Skip to content
#

multiple-knapsack-problem

Here are 7 public repositories matching this topic...

Language: All
Filter by language

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.

  • Updated Mar 15, 2025
  • Python

This repository is accompanying the paper "Multi-User Frequency Assignment for Ultra-Reliable mmWave Two-Ray Channels" (WiOpt 2022, DOI:10.23919/WiOpt56218.2022.9930571)

  • Updated Nov 15, 2022
  • Python

Improve this page

Add a description, image, and links to the multiple-knapsack-problem 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 multiple-knapsack-problem topic, visit your repo's landing page and select "manage topics."

Learn more