Skip to Main Content (Press Enter)

Logo UNIMORE
  • ×
  • Home
  • Degree programmes
  • Modules
  • Jobs
  • People
  • Research Outputs
  • Academic units
  • Third Mission
  • Projects
  • Skills

UNI-FIND
Logo UNIMORE

|

UNI-FIND

unimore.it
  • ×
  • Home
  • Degree programmes
  • Modules
  • Jobs
  • People
  • Research Outputs
  • Academic units
  • Third Mission
  • Projects
  • Skills
  1. Research Outputs

Models and algorithms for the bin packing problem with fragile objects

Conference Paper
Publication Date:
2011
Short description:
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. ( 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011 Frascati (Roma) 14 - 16 Giugno 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.
Iris type:
Relazione in Atti di Convegno
Keywords:
Bin Packing Problem, Fragile Objects, Column Generation, Mathematical Models
List of contributors:
Alba Martinez, Manuel Angel; Clautiaux, François; Dell'Amico, Mauro; Iori, Manuel
Authors of the University:
DELL'AMICO Mauro
IORI MANUEL
Handle:
https://iris.unimore.it/handle/11380/1066306
Book title:
10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011 - Proceedings of the Conference
  • Use of cookies

Powered by VIVO | Designed by Cineca | 26.5.1.0