In the Bin Packing Problem with Fragile Objects (BPPFO), we are given n objects, each having a given weight and a given fragility, and a large number of uncapacitated bins. The aim is to pack all objects in the minimum number of bins, in such a way that in each bin the sum of the object weights is less than or equal to the smallest fragility of an object.
Models and algorithms for the bin packing problem with fragile objects / ALBA MARTINEZ, Manuel Angel; Clautiaux, François; Dell'Amico, Mauro; Iori, Manuel. - ELETTRONICO. - (2011), pp. 36-39. (Intervento presentato al convegno 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011 tenutosi a Frascati (Roma) nel 14 - 16 Giugno 2011).
Models and algorithms for the bin packing problem with fragile objects
ALBA MARTINEZ, Manuel Angel;DELL'AMICO, Mauro;IORI, MANUEL
2011
Abstract
In the Bin Packing Problem with Fragile Objects (BPPFO), we are given n objects, each having a given weight and a given fragility, and a large number of uncapacitated bins. The aim is to pack all objects in the minimum number of bins, in such a way that in each bin the sum of the object weights is less than or equal to the smallest fragility of an object.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
