2025/09/01 by Groschke, Christof, Goebbels, Steffen, Rethmann, Jochen
#90-05 #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #G.1.6
paper · doi:10.48550/arxiv.2509.01218
In this study, we examine a two-dimensional bin-packing problem in printed circuit board manufacturing. Among other objectives, the number of bins, but also the number of different bin layouts, is to be minimized. As the running times of an earlier MIP presentation are only acceptable for small problem instances, we will now discuss a branch-and-price approach by using an adapted Ryan-Foster-branching. The pricing problem computes the layouts, separating the time-consuming constraints from the master problem.