An exact algorithm for the dual bin packing problem

Authors:
Martine Labbé;Gilbert Laporte;Silvano Martello
Affiliations:
Service de Mathématiques de la Gestion, Case postale 210/01, Université Libre de Bruxelles, Boulevard du Triomphe, B-1050, Bruxelles, Belgium;GERAD, École des Hautes Études Commerciales, 5255 avenue Decelles, Montréal, Canada H3T IV6;Dipartimento di Informatica, Università di Torino, Via Pessinetto 12, 10100 Torino, Italy
Venue:
Operations Research Letters
Year:
1995

Citing 6
Cited 3

Probabilistic bounds for dual bin-packing

Acta Informatica
Online algorithms for a dual version of bin packing

Discrete Applied Mathematics
Probabilistic analysis of a heuristics for the dual bin packing problem

Information Processing Letters
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Probabilistic analysis of algorithms for dual bin packing problems

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Timing analysis of the FlexRay communication protocol

Real-Time Systems
Bin completion algorithms for multicontainer packing, knapsack, and covering problems

Journal of Artificial Intelligence Research
Bin-completion algorithms for multicontainer packing and covering problems

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the Dual Bin Packing Problem (DBP), there is an unlimited number of bins of identical capacity, and unsplittable items of given weights. The aim is to pack items in as many bins as possible so that the total weight of each bin is at least equal to its capacity. This article proposes reduction criteria, upper bounds, and an enumerative algorithm for the DBP. Computational results are presented.