I am currently stuck in finding an efficient algorithm to solve for a 3D rectangular box packing (trying to fit ‘x’ amount of boxes with dimensions (l1;w1;h1), (l2;w2;h2),…,(ln;wn;hn) into a larger generic box with dimensions Length (l) = 500, Width (w) = 500 and Height (h) = 450. I have done a bit research and found this problem similar to a “Bin packing problem” with the restriction of having only one bin. I was wondering if anyone would be able to assist me in solving this problem. Any help would be much appreciated! 