Reproduce “Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.