Robust Extensible Bin Packing and Revisiting a Convex Knapsack Problem

Noam Goldberg, Michael Poss, Yariv Marmor

We study a robust extensible bin packing problem, under a budget uncertainty model where item sizes lie in the intersection of a box with a one-norm ball. We design an algorithm ba…