New bin packing fast lower bounds

Authors:
Teodor Gabriel Crainic;Guido Perboli;Miriam Pezzuto;Roberto Tadei
Affiliations:
Département de management et technologie, U.Q.A.M., U. de Montréal C.P. 6128, Succursale Centre-ville-H3C 3J7 Montreal, Que., Canada and Centre de recherche sur les transports, U. de Mon ...;Department of Control and Computer Engineering, Politecnico di Torino, Corso Duca degli Abruzzi, 24 I-10129 Torino, Italy;Department of Control and Computer Engineering, Politecnico di Torino, Corso Duca degli Abruzzi, 24 I-10129 Torino, Italy;Department of Control and Computer Engineering, Politecnico di Torino, Corso Duca degli Abruzzi, 24 I-10129 Torino, Italy
Venue:
Computers and Operations Research
Year:
2007

Citing 10
Cited 3

Lower bounds and reduction procedures for the bin packing problem

Discrete Applied Mathematics - Combinatorial Optimization
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
A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

Journal of Heuristics
An analysis of lower bound procedures for the bin packing problem

Computers and Operations Research
Fast lifting procedures for the bin packing problem

Discrete Optimization
A tight lower bound for optimal bin packing

Operations Research Letters

Solving an avionics real-time scheduling problem by advanced IP-methods

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
The Bin Packing Problem with Precedence Constraints

Operations Research
The Bin Packing Problem with Precedence Constraints

Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we address the issue of computing fast lower bounds for the Bin Packing problem, i.e., bounds that have a computational complexity dominated by the complexity of ordering the items by non-increasing values of their volume. We introduce new classes of fast lower bounds with improved asymptotic worst-case performance compared to well-known results for similar computational effort. Experimental results on a large set of problem instances indicate that the proposed bounds reduce both the deviation from the optimum and the computational effort.