Showing 1 - 2 of 2
Persistent link: https://www.econbiz.de/10014566107
Given a set of rectangular pieces to be cut from an unlimited number of standardized stock pieces (bins), the Two-Dimensional Finite Bin Packing Problem is to determine the minimum number of stock pieces that provide all the pieces. The problem is NP-hard in the strong sense and finds many...
Persistent link: https://www.econbiz.de/10009208704