An on-line bin-batching problem.

DOI10.1016/S0166-218X(00)00243-2zbMath1033.90112OpenAlexW2010014647MaRDI QIDQ5929317

Guo-Chuan Zhang

Publication date: 18 February 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00243-2

zbMATH Keywords

bin coveringon-line algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Approximation algorithms (68W25)

Related Items (1)

Batched bin packing

Cites Work

• Unnamed Item
• Unnamed Item
• Online algorithms. The state of the art
• Online algorithms for a dual version of bin packing
• Optimal on-line algorithms for variable-sized bin covering
• On a dual version of the one-dimensional bin packing problem

This page was built for publication: An on-line bin-batching problem.