Consistency Check for the Bin Packing Constraint Revisited

摘要

The bin packing problem (BP) consists in finding the minimum number of bins necessary to pack a set of items so that the total size of the items in each bin does not exceed the bin capacity C. The bin capacity is common for all the bins. This problem can be solved in Constraint Programming (CP) by introducing one placement variable x_i for each item and one load variable l_j for each bin.