Mmastodon TechnologySoftware first seen 3 d ago, last 3 d ago, peak #9

Solving the 0/1 knapsack problem with PyTorch

Original: 0/1 Knapsack Problem in PyTorch https://jedrzej.maczan.pl/2025_11_21_dp_knapsack_sliding_hirschberg # HackerNews # Tech

A new blog post by Jedrzej Maczan walks through implementing the classic 0/1 knapsack problem in PyTorch, using dynamic programming with a sliding window technique and the Hirschberg method to reduce memory usage. The piece shows how GPU-oriented tensor libraries can be applied to traditional algorithm problems, a pairing that has caught the attention of programmers online.

Why now: Programmers find it novel to apply PyTorch, usually a machine learning tool, to a classic algorithms problem with memory-efficient techniques.

Jedrzej MaczanPyTorch0/1 knapsack problemHirschberg algorithm

Open on mastodon →

Rank over time, top of the chart is #1. 6 snapshots from 3 d ago to 3 d ago.

Evidence

• 0/1 Knapsack Problem in PyTorch https://jedrzej.maczan.pl/2025_11_21_dp_knapsack_sliding_hirschberg # HackerNews # Tech # Programming · hackernews@robot.villas · 2

API: https://socialmediatrends-api.osmike.com/v1/trends/3777788