elsevier 外文文献一篇

题目:Lower bounds and reduction procedures for the bin packing problem

作者: Silvano Martello and Paolo Toth

出处：Discrete Applied Mathematics Volume 28, Issue 1, July 1990, Pages 59-70  

相关链接：linkinghub.elsevier.com/retrieve/pii/0166218X9090094S

下载后请将此回复选为“最佳答案”

1# jinpenghfut
我没有权限下载。。。

  Discrete Applied Mathematics
  Volume 28, Issue 1, July 1990,Pages 59-70  

doi:10.1016/0166-218X(90)90094-S | How to Cite or Link Using DOI Copyright © 1990 Published by Elsevier Science B.V. All rights reserved.

Permissions & Reprints

   Lower bounds and reduction procedures for the bin packing problem


This article is not included in your organization's subscription. However, you may be able to access this article under your organization's agreement with Elsevier.



Silvano Martello and Paolo Toth

DEIS-University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy


Received 27 October 1989.  
Available online 13 May 2002.  

AbstractThe bin packing problem, in which a set of items of various sizes has to be packed into a minimum number of identical bins, has been extensively studied during the past fifteen years, mainly with the aim of finding fast heuristic algorithms to provide good approximate solutions. We present lower bounds and a dominance criterion and derive a reduction algorithm. Lower bounds are evaluated through an extension of the concept of worst-case performance. For both lower bounds and reduction algorithm an experimental analysis is provided.


Author Keywords: Bin packing problem; lower bound; worst-case performance; dominance criterion; reduction algorithm

同无权限~~~