Worst-case bounds for bin-packing heuristics with applications to the duality gap of the one-dimensional cutting stock problem