Code and Data Repository for Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation
该软件评估了求解最小颜色碎片装箱问题的不同整数线性规划模型，并研究了改变箱子数量对最优解值的影响。
The goal of this software is to evaluate different ILP models for solving the Bin Packing Problem with Minimum Color Fragmentation (BPPMCF), and also to investigate the effect of changing the number of bins on the optimal solution value.