Relaxations and exact solution of the variable sized bin packing problem

Authors:
Mohamed Haouari;Mehdi Serairi
Affiliations:
Department of Industrial Engineering, Faculty of Engineering, Ozyegin University, Istanbul, Turkey and Princess Fatimah Alnijris' Research Chair for AMT, College of Engineering, King Saud Universi ...;ROI --- Combinatorial Optimization Research Group, Ecole Polytechnique de Tunisie, La Marsa, Tunisia 2078
Venue:
Computational Optimization and Applications
Year:
2011

Citing 12
Cited 4

Variable sized bin packing

SIAM Journal on Computing
An efficient approximation scheme for variable-sized bin packing

SIAM Journal on Computing
Bin packing with divisible item sizes

Journal of Complexity
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Worst-case analysis of the FFH algorithm for online variable-sized bin packing

Computing
An improved lower bound for the bin packing problem

Discrete Applied Mathematics
Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms

SIAM Journal on Computing
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem

Management Science
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem

Computers and Operations Research
Solving the variable size bin packing problem with discretized formulations

Computers and Operations Research
The two-dimensional bin packing problem with variable bin sizes and costs

Discrete Optimization
Worst-case analysis of the subset sum algorithm for bin packing

Operations Research Letters

Heuristics for the variable sized bin-packing problem

Computers and Operations Research
Hybrid algorithms for the variable sized bin packing problem

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Variable neighbourhood search for the variable sized bin packing problem

Computers and Operations Research
Efficient algorithms for real-life instances of the variable size bin packing problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address a generalization of the classical one-dimensional bin packing problem with unequal bin sizes and costs. We investigate lower bounds for this problem as well as exact algorithms. The main contribution of this paper is to show that embedding a tight network flow-based lower bound, dominance rules, as well as an effective knapsack-based heuristic in a branch-and-bound algorithm yields very good performance. In addition, we show that the particular case with all weight items larger than a third the largest bin capacity can be restated and solved in polynomial-time as a maximum-weight matching problem in a nonbipartite graph. We report the results of extensive computational experiments that provide evidence that large randomly generated instances are optimally solved within moderate CPU times.