Lower bounds and reduction procedures for the bin packing problem

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