Formal problems
Mathematical / OR problem classes. Industry names map onto these.
- 0/1 Knapsack Problem
Select items to maximize value under a capacity constraint.
- 1D Cutting Stock
Cut stock rods/rolls into ordered lengths, minimizing waste or stock used.
- 2D Knapsack
Select a subset of rectangles for a single sheet, maximizing value (or area).
- 2D Irregular Nesting
Place irregular parts on stock material without overlap, minimizing waste.
- 2D Bin Packing
Pack rectangles into the fewest fixed-size bins.
- 2D Strip Packing
Pack rectangles into a fixed-width strip, minimizing used height.
- 3D Bin Packing
Load boxes into the fewest fixed-size containers/bins.
- Variable-Sized Bin Packing
Pack into bins of several sizes/costs to minimize total bin cost.
- Guillotine Cutting
Orthogonal cutting constrained to edge-to-edge straight cuts.
- Pallet Loading
Place the maximum number of identical boxes on a pallet.