= Strip packing problem
{wiki=Strip_packing_problem}
The strip packing problem is a classic optimization problem in the field of combinatorial optimization and computational geometry. The problem involves packing a set of items (usually rectangles) into a larger rectangular container, termed a "strip," with the objective of minimizing the height of the strip that is used. \#\#\# Problem Definition: 1. **Items**: You have a collection of rectangular items, each defined by its width and height.
Back to article page
