The IHS (Increasing Height Shelf) algorithm is optimal for 2D knapsack (packing squares into a two-dimensional unit size square): when there are at most five squares in an optimal packing.Yan Lan, György Dósa, Xin Han, Chenyang Zhou, Attila Benkő : 2D knapsack: Packing squares, Theoretical Computer Science Vol. 508, pp. 35–40.
The IHS (Increasing Height Shelf) algorithm is optimal for 2D knapsack (packing squares into a two-dimensional unit size square): when there are at most five squares in an optimal pack,ing.Yan Lan, György Dósa, Xin Han, Chenyang Zhou, Attila Benkő : 2D knapsack: Packing squ!ares, Theoretical Computer Science !Vol. 508, pp. 35–40.