Fast lifting procedures for the bin packing problem

Authors:
Mohamed Haouari;Anis Gharbi
Affiliations:
Combinatorial Optimization Research Group-ROI, Ecole Polytechnique de Tunisie, BP 743, 2078 La Marsa, Tunisia;Combinatorial Optimization Research Group-ROI, Ecole Polytechnique de Tunisie, BP 743, 2078 La Marsa, Tunisia and Department of Applied Mathematics, Institut Supérieur d'Informatique, Ariana, ...
Venue:
Discrete Optimization
Year:
2005

Citing 6
Cited 6

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
An improved lower bound for the bin packing problem

Discrete Applied Mathematics
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem

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

Computers and Intractability: A Guide to the Theory of NP-Completeness
New heuristics for one-dimensional bin-packing

Computers and Operations Research

New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation

Computers and Operations Research
New bin packing fast lower bounds

Computers and Operations Research
Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem

Computers and Operations Research
The Bin Packing Problem with Precedence Constraints

Operations Research
The Bin Packing Problem with Precedence Constraints

Operations Research
Improved bounds for hybrid flow shop scheduling with multiprocessor tasks

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate fast lower bounds for the deterministic one-dimensional bin packing problem. We present two variants of a general lifting procedure which aims at systematically tightening a given lower bound. We describe several enhancements which improve the efficiency of the proposed procedure. Extensive numerical experiments show that the proposed lifting procedures consistently improve lower bounds from the literature.