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