yash8005 / three-dimensional-bin-packing-problem Goto Github PK
View Code? Open in Web Editor NEWThe Three-Dimensional Bin Packing Problem (3BP) consists of allocating, without overlapping, a given set of three dimensional rectangular items to three-dimensional identical finite bins. The problem is NP hard in the strong sense, and finds many industrial applications. We in this process have made used to heuristic approach rather than greedy algorithm.