Instance space analysis for 2D bin packing mathematical models
用实例空间分析方法比较四种混合整数规划模型在二维装箱问题上的求解性能，以CPLEX求解时间为指标，揭示不同实例特征下的模型表现差异。
In this paper, we apply Instance Space Analysis (ISA) to study the two-dimensional bin-packing problem. We consider classical and newly-generated instances to test the performance of four mixed-integer programming (MIP) models from the literature. This is the first time ISA is used to compare MIP models. We set as a performance metric the time taken by the black-box MIP solver CPLEX to obtain a proven optimal solution when running each model. Our results provide a new perspective on the different models’ performance according to each instance’s features.