Batched bin packing

DOI10.1016/J.DISOPT.2004.11.001MaRDI QIDQ1779689zbMATH OpenOpenAlexFDO

Authors G. Gutin, A. Yeo, T. R. Jensen

Publication date 1 June 2005

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2004.11.001

zbMATH Keywords

Competitive ratioLower boundsBin packingOn-line algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Batched bin packing revisited
• More on batched bin packing
• Lower bound for 3-batched bin packing
• Lower bounds for batched bin packing
• Online bin packing problem with buffer and bounded size revisited

Cites work

• scientific article; zbMATH DE number 4130003 (Why is no real title available?)
• scientific article; zbMATH DE number 6118219 (Why is no real title available?)
• scientific article; zbMATH DE number 910900 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• A lower bound for on-line bin packing
• A simple on-line bin-packing algorithm
• An improved lower bound for on-line bin packing algorithms
• An on-line bin-batching problem.
• Approximation algorithms for NP-hard problems.
• Does randomization help in on-line bin packing?
• Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
• New Algorithms for Bin Packing
• On-line bin packing with two item sizes
• Online algorithms. The state of the art
• Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
• Repacking helps in bounded space on-line bin-packing

Cited in

(23)

• Batched bin packing revisited
• Semi-on-line bin packing: a short overview and a new lower bound
• Several methods of analysis for cardinality constrained bin packing
• Several methods of analysis for cardinality constrained bin packing
• Minimum Weighted Sum Bin Packing
• Lower bound for 3-batched bin packing
• Batch coloring of graphs
• More on batched bin packing
• Lower bounds for batched bin packing
• Resource augmented semi-online bounded space bin packing
• Improved lower bounds for semi-online bin packing problems
• Batch Coloring of Graphs
• Packing batches of items into a single bin
• Strip Packing vs. Bin Packing
• Open-end bin packing: new and old analysis approaches
• On bin packing with clustering and bin packing with delays
• Spaced batch means
• Chains-into-Bins Processes
• Packing batches of cubes into a single bin
• Min-sum bin packing
• Tight bounds for NF-based bounded-space online bin packing algorithms
• On-line bin packing with restricted repacking
• More on online bin packing with two item sizes

This page was built for publication: Batched bin packing

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