Before revision: We study harmonic-based algorithms for the d-dimensional (dD) generalizations of three classical geometric packing problems: geometric bin packing (BP), strip packing (SP), and geometric knapsack (KS) . Caprara (MOR 2008) studied a harmonic-based algorithm \mathtt{HDH an asymptotic approximation ratio  of T_{\infty}^{d-1} (where T_{\infty} \approx 1.691) for dD BP and dD SP when items are not allowed to be rotated.
After revision: We study harmonic-based algorithms for the d-dimensional (dD) generalizations of three classical geometric packing problems: geometric bin packing (BP), strip packing (SP), and geometric knapsack (KS) . Caprara (MOR 2008) studied a harmonic-based algorithm \mathtt{HDH an asymptotic approximation ratio of T_{\infty}^{d-1} (where T_{\infty} \approx 1.691) . However, their algorithm doesn't allow items to be rotated.