Name
Abstract | ||
|---|---|---|
Bin Packing with Minimum Color Fragmentation (BPMCF) is an extension of the Bin Packing Problem in which each item has a size and a color and the goal is to minimize the sum of the number of bins containing items of each color. In this work, we introduce BPMCF and present a decomposition strategy to solve the problem, where the assignment of items to bins is formulated as a binary decision diagram and an optimal integrated solutions is identified through a mixed-integer linear programming model. Our computational experiments show that the proposed approach greatly outperforms a direct formulation of BPMCF and that its performance is suitable for large instances of the problem. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Data Structures and Algorithms | Mathematical optimization,Computer science,Binary decision diagram,Fragmentation (computing),Integer programming,Linear programming,Bin packing problem |
DocType | Volume | Citations |
Journal | abs/1812.00059 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Bergman | 1 | 37 | 7.54 |
| Carlos Cardonha | 2 | 0 | 1.01 |
| Saharnaz Mehrani | 3 | 0 | 0.68 |