New classes of fast lower bounds for bin packing problems
From MaRDI portal
Publication:5955558
DOI10.1007/s101070100243zbMath1051.90020MaRDI QIDQ5955558
Sándor P. Fekete, Jörg Schepers
Publication date: 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100243
Related Items
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation, Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem, New bin packing fast lower bounds, On the two-dimensional knapsack problem, Solving the one-dimensional bin packing problem with a weight annealing heuristic, A generic view of Dantzig--Wolfe decomposition in mixed integer programming, The two-dimensional bin packing problem with variable bin sizes and costs, State-of-the-art exact and heuristic solution procedures for simple assembly line balancing, Fast lifting procedures for the bin packing problem, A new exact method for the two-dimensional orthogonal packing problem, Computing the asymptotic worst-case of bin packing lower bounds
Uses Software