The short version
0–1 knapsack solver recommended for medium-to-large optimization problems; implementation and references included.
From the HackerLinks archive
COMBO
0–1 knapsack solver recommended for medium-to-large optimization problems; implementation and references included.
At a glance:
First seen:2026-10-18
Last seen:2026-10-18
Times seen:1
Website:hjemmesider.diku.dk
Why it caught our attention
A specific algorithm recommendation offers an actionable alternative to the submitted implementation.
Where it surfaced on Hacker News
2026-10-18
“In practice one should almost always use the "combo" algorithm to solve 0-1 knapsack problems. It will likely be orders of magnitude faster than any of these approaches (for medium-large instances, at least).”
7scan · recommendation
Direct HN comment
0/1 Knapsack Problem in PyTorch