Column-generation for a two-dimensional multi-criteria bin-packing problem
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909763779952640 |
|---|---|
| author | Groschke, Christof Goebbels, Steffen Rethmann, Jochen |
| author_facet | Groschke, Christof Goebbels, Steffen Rethmann, Jochen |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_01218 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Column-generation for a two-dimensional multi-criteria bin-packing problem Groschke, Christof Goebbels, Steffen Rethmann, Jochen Data Structures and Algorithms 90-05 G.1.6 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. |
| title | Column-generation for a two-dimensional multi-criteria bin-packing problem |
| topic | Data Structures and Algorithms 90-05 G.1.6 |
| url | https://arxiv.org/abs/2509.01218 |