An analysis of lower bound procedures for the bin packing problem

@article{Bourjolly2005AnAO,
  title={An analysis of lower bound procedures for the bin packing problem},
  author={Jean-Marie Bourjolly and Vianney Rebetez},
  journal={Computers & OR},
  year={2005},
  volume={32},
  pages={395-405}
}
In this paper, we review LB2 and LB3, two lower bounds for the bin packing problem that were respectively introduced by Martello and Toth and by Labb3 e, Laporte and Mercure. We prove that LB3¿LB2. We also prove that the worst-case asymptotic performance ratio of LB3 is 4 and that this ratio cannot be improved. We study LB2, LB3 and three of their variants both analytically and computationally. In particular, we clarify the relationships between LB2′′, the bound implemented by Martello and Toth… CONTINUE READING
BETA

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Le probl6 eme de la mise en bo8̂tes: un algorithme de r3 esolution, Centre de recherche sur les transports, Universit3 e de Montr3 eal

  • V. Rebetez
  • 1994
1 Excerpt

An application of bin packing to building block placement

  • C Chen, M. Liu
  • International Symposium on Circuits and Systems…
  • 1987
1 Excerpt

Approximation algorithms for bin packing—an updated survey

  • EG CoRman, MR Garey, DS. Johnson
  • 1984
1 Excerpt

An application of bin packing to mutiprocessor scheduling

  • EG CoRman, MR Garey, DS. Johnson
  • SIAM Journal on Computing
  • 1978
1 Excerpt

Bin packing applied to port allocation in a multiprocessor packet switch

  • V Prabhu, Tam RMK
  • International Conference on Communications…
  • 1978
1 Excerpt

Similar Papers

Loading similar papers…