A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, f, for assigning item j to bin i; and a separate packing constraint for each bin—i.e., ...
We present a tree-search algorithm for two-dimensional cutting problems in which there is a constraint on the maximum number of each type of piece that is to be produced. The algorithm limits the size ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback