New Results in Priority-Based Bin Packing.

In this paper, we discuss new algorithmic results for bin minimization in the subset-constrained variant of Priority-based bin packing (PBBP-SC). This problem was introduced in [ 21 ], as an abstract model for capturing certain issues in database migration and palleting. This paper focuses on new fine-grained complexity results for the bin minimization problem (BMP) under two distinct parameterizations. We also provide a detailed empirical analysis of integer programming formulations for the problems discussed in this paper.