A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
On the Use of Equivalence Classes for Optimal and Suboptimal Bin Packing and Bin Covering
2020
IEEE Transactions on Automation Science and Engineering
Bin packing and bin covering are important optimization problems in many industrial fields, such as packaging, recycling, and food processing. The problem concerns a set of items, each with its own value, that are to be sorted into bins in such a way that the total value of each bin, as measured by the sum of its item values, is not above (for packing) or below (for covering) a given target value. The optimization problem concerns minimizing, for bin packing, or maximizing, for bin covering,
doi:10.1109/tase.2020.3022986
fatcat:oeevrcolazamfcttncn6qg6xqi