Medium Problemsoptimizationlinear
Box-Stacking Problem
Given n boxes, each with a length, width, and height, and free rotation of each box among its three orientations, stack boxes so that each box's base fits strictly inside the base of the box beneath it. Maximize the total height of the stack.
Do this lesson first: house robberThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.