Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.24785 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911347914047488 |
|---|---|
| author | Baldacci, Roberto Ciccarelli, Fabio Coniglio, Stefano Dose, Valerio Furini, Fabio |
| author_facet | Baldacci, Roberto Ciccarelli, Fabio Coniglio, Stefano Dose, Valerio Furini, Fabio |
| contents | We study constant-factor approximation algorithms for the Bin Packing Problem with Setups (BPPS). First, we show that adaptations of classical BPP heuristics can have arbitrarily poor worst-case performance on BPPS instances. Then, we propose a two-phase heuristic for the BPPS that applies an α-approximation algorithm for the BPP to the items of each class and then performs a merging phase on the open bins. We prove that this heuristic is a 2 α-approximation algorithm for the BPPS. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_24785 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A first approximation algorithm for the Bin Packing Problem with Setups Baldacci, Roberto Ciccarelli, Fabio Coniglio, Stefano Dose, Valerio Furini, Fabio Optimization and Control We study constant-factor approximation algorithms for the Bin Packing Problem with Setups (BPPS). First, we show that adaptations of classical BPP heuristics can have arbitrarily poor worst-case performance on BPPS instances. Then, we propose a two-phase heuristic for the BPPS that applies an α-approximation algorithm for the BPP to the items of each class and then performs a merging phase on the open bins. We prove that this heuristic is a 2 α-approximation algorithm for the BPPS. |
| title | A first approximation algorithm for the Bin Packing Problem with Setups |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2512.24785 |