Name
Abstract | ||
|---|---|---|
In this paper we consider a class of bin packing problems from the literature having the following distinctive feature: items may be fragmented at a price. Problems of this kind arise in diverse application fields like logistics and telecommunications, and have already been extensively tackled from an approximation point of view. We focus on the case in which splitting produces no overhead, a fixed number of bins is given and the number of fragments or fragmentations needs to be minimized. We first investigate the theoretical properties of the problem. Then we elaborate on them to devise mathematical programming models and algorithms, yielding both exact optimization algorithms and effective heuristics. An extensive experimental campaign proves that our approach is very effective, and highlights which features make an instance computationally harder to solve. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.cor.2013.12.008 | Computers & OR |
Keywords | DocType | Volume |
mathematical programming model,instance computationally,item fragmentation,extensive experimental campaign,bin packing problem,mathematical programming algorithm,approximation point,diverse application field,fixed number,exact optimization algorithm,effective heuristics,following distinctive feature | Journal | 46, |
ISSN | Citations | PageRank |
0305-0548 | 14 | 1.04 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco Casazza | 1 | 37 | 4.40 |
| Alberto Ceselli | 2 | 341 | 30.53 |