ALBA MARTÍNEZ, Manuel; CLAUTIAUX, François; DELL'AMICO, Mauro; IORI, Manuel

doi:10.1016/j.disopt.2013.06.001

Métadonnées

Licence d’utilisation du document

ALBA MARTÍNEZ, Manuel
Università degli Studi di Modena e Reggio Emilia = University of Modena and Reggio Emilia [UNIMORE]

CLAUTIAUX, François
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]

DELL'AMICO, Mauro
Università degli Studi di Modena e Reggio Emilia = University of Modena and Reggio Emilia [UNIMORE]

Langue

Article de revue

Ce document a été publié dans

Discrete Optimization. 2013-08-31, vol. 10, n° 3, p. 210-223

Elsevier

Résumé en anglais

We are given a set of objects, each characterized by a weight and a fragility, and a large number of uncapacitated bins. Our aim is to find the minimum number of bins needed to pack all objects, 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 in the bin. The problem is known in the literature as the Bin Packing Problem with Fragile Objects, and appears in the telecommunication field, when one has to assign cellular calls to available channels by ensuring that the total noise in a channel does not exceed the noise acceptance limit of a call.We propose a branch-and-bound and several branch-and-price algorithms for the exact solution of the problem, and improve their performance by the use of lower bounds and tailored optimization techniques. In addition we also develop algorithms for the optimal solution of the related knapsack problem with fragile objects. We conduct an extensive computational evaluation on the benchmark set of instances, and show that the proposed algorithms perform very well.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

Exact algorithms for the bin packing problem with fragile objects

Langue

Ce document a été publié dans

Résumé en anglais

URI

DOI

Origine

Unités de recherche