A lower bound for the non-oriented two-dimensional bin packing problem

Authors:
Mauro Dell'Amico;Silvano Martello
Affiliations:
DISMI, Università di Modena e Reggio Emilia, via Allegri 15, I-42100 Reggio Emilia, Italy;DEIS, Università di Bologna, Viale Risorgimento 2, I-40136 Blogna, Italy
Venue:
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Year:
2002

Citing 3
Cited 14

Exact Solution of the Two-Dimensional Finite Bon Packing Problem

Management Science
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems

INFORMS Journal on Computing
The Three-Dimensional Bin Packing Problem

Operations Research

Recent advances on two-dimensional bin packing problems

Discrete Applied Mathematics
This side up!

ACM Transactions on Algorithms (TALG)
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

INFORMS Journal on Computing
New resolution algorithm and pretreatments for the two-dimensional bin-packing problem

Computers and Operations Research
Ant colony optimization for the two-dimensional loading vehicle routing problem

Computers and Operations Research
Two-dimensional online bin packing with rotation

Theoretical Computer Science
On index structures in hybrid metaheuristics for routing problems with hard feasibility checks: an application to the 2-dimensional loading vehicle routing problem

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts

Computers and Operations Research
This side up!

WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
DC programming and DCA for large-scale two-dimensional packing problems

ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
A new lower bound for the non-oriented two-dimensional bin-packing problem

Operations Research Letters
Packing into the smallest square: Worst-case analysis of lower bounds

Discrete Optimization
The two-dimensional bin packing problem with variable bin sizes and costs

Discrete Optimization
Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a set of rectangular items, and an unlimited number of identical rectangular bins, we consider the problem of allocating, without overlapping, all the items to the minimum number of bins. We assume that the items may be rotated by 90°. The problem is strongly NP-hard, and has several industrial applications. No specific lower bound is known for it. We present a lower bound which explicitly takes into account the possible item rotation. The bound is embedded into an exact branch-and-bound algorithm. The average performance is evaluated through computational experiments.