A bin packing problem with over-sized items

DOI10.1016/S0167-6377(02)00118-9zbMath1096.90031OpenAlexW2066795181MaRDI QIDQ1612008

Wen-Xun Xing

Publication date: 28 August 2002

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00118-9

zbMATH Keywords

HeuristicsBin packingWorst case analysis

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Variable Sized Bin Packing
• An Efficient Approximation Scheme for Variable-Sized Bin Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• On-line bin packing ? A restricted survey

This page was built for publication: A bin packing problem with over-sized items