Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing

DOI10.1051/ro:2006001zbMath1101.68982OpenAlexW2026961896MaRDI QIDQ5479859

Luke Finlay, Prabhu Manyem

Publication date: 11 July 2006

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2005__39_3_163_0

zbMATH Keywords

bin packing problemasymptotic worst case ratiobin covering problemlongest itemonline approximation algorithmuniform sized bins

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (4)

Bin packing with ``largest in bottom constraint: tighter bounds and generalizations ⋮ Colored bin packing: online algorithms and lower bounds ⋮ More on ordered open end bin packing ⋮ Comparing the costs of any fit algorithms for bin packing

Cites Work

• Online algorithms for a dual version of bin packing
• An improved lower bound for on-line bin packing algorithms
• Optimal on-line algorithms for variable-sized bin covering
• On the sum-of-squares algorithm for bin packing
• On a dual version of the one-dimensional bin packing problem
• A simple on-line bin-packing algorithm
• Bin covering algorithms in the second stage of the lot to order matching problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing