An on-line bin-batching problem.

DOI10.1016/S0166-218X(00)00243-2MaRDI QIDQ5929317zbMATH OpenOpenAlexFDO

Authors Guochuan 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

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On a dual version of the one-dimensional bin packing problem
• Online algorithms for a dual version of bin packing
• Online algorithms. The state of the art
• Optimal on-line algorithms for variable-sized bin covering
• Two simple algorithms for bin covering

Cited in

(1)

• Batched bin packing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929317)