Computing the asymptotic worst-case of bin packing lower bounds

DOI10.1016/j.ejor.2005.07.032zbMath1135.90027OpenAlexW2077707231WikidataQ58644533 ScholiaQ58644533MaRDI QIDQ2643960

Teodor Gabriel Crainic, Miriam Pezzuto, Guido Perboli, Roberto Tadei

Publication date: 27 August 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.07.032

zbMATH Keywords

packingasymptotic worst-case analysisbin packing lower bounds

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ New bin packing fast lower bounds ⋮ A new destructive bounding scheme for the bin packing problem ⋮ An asymptotic approximation scheme for the concave cost bin packing problem ⋮ Lower bounds for a bin packing problem with linear usage cost ⋮ A generalized bin packing problem for parcel delivery in last-mile logistics ⋮ Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem ⋮ Bin packing problem with conflicts and item fragmentation

Cites Work

• New bin packing fast lower bounds
• Lower bounds and reduction procedures for the bin packing problem
• An analysis of lower bound procedures for the bin packing problem
• An improved typology of cutting and packing problems
• Capacitated Vehicle Routing on Trees
• New classes of fast lower bounds for bin packing problems
• Unnamed Item
• Unnamed Item