multiple-knapsack-problem
Here are 7 public repositories matching this topic...
[NeurIPS 2024] ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution
- Updated
May 14, 2025 - Python
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
Python testbed for the Quadratic Multiple Knapsack Problem (QMKP)
- Updated
Apr 4, 2023 - 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
Solves the multiple knapsack problem with a greedy algorithm
- Updated
Apr 18, 2021 - C#
A solution to a Multiple Knapsack Problem (MKP)
- Updated
Feb 10, 2020 - Java
Improve this page
Add a description, image, and links to themultiple-knapsack-problem topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with themultiple-knapsack-problem topic, visit your repo's landing page and select "manage topics."