New lower bounds for the three-dimensional finite bin packing problem

  title={New lower bounds for the three-dimensional finite bin packing problem},
  author={Marco A. Boschetti},
  journal={Discrete Applied Mathematics},
The three-dimensional $nite bin packing problem (3BP) consists of determining the minimum number of large identical three-dimensional rectangular boxes, bins, that are required for allocating without overlapping a given set of three-dimensional rectangular items. The items are allocated into a bin with their edges always parallel or orthogonal to the bin edges. The problem is strongly NP-hard and $nds many practical applications. We propose new lower bounds for the problem where the items have… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 19 extracted citations


Publications referenced by this paper.
Showing 1-10 of 16 references

On more-dimensional packing II: bounds

  • S. P. Fekete, J. Schepers
  • Technical Report 97.289, UniversitZ at zu KZ oln…
  • 2000
Highly Influential
5 Excerpts

Exact solution of the two dimensional $nite bin packing problem

  • S. Martello, D. Vigo
  • Manage. Sci. 44
  • 1998
Highly Influential
5 Excerpts

Two dimensional $nite bin packing algorithms

  • J. O. Berkey, P. Y. Wang
  • J. Oper. Res. Soc. 38
  • 1987
Highly Influential
5 Excerpts

Bin packing approximation algorithms: combinatorial analysis

  • E. G. Co4man, G. Galambos, S. Martello, D. Vigo
  • Handbook of Combinatorial Optimization,
  • 1999
1 Excerpt

Similar Papers

Loading similar papers…