Online variable-sized bin packing

DOI10.1016/0166-218X(88)90089-3MaRDI QIDQ1111472zbMATH OpenOpenAlexFDO

Authors Nancy G. Kinnersley, Michael A. Langston

Publication date 1989

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

Full work available at URL https://doi.org/10.1016/0166-218x(88)90089-3

zbMATH Keywords

online algorithmsbin packingoffline approximation algorithmsworst- case ratio

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Recommendations

• Online variable-sized bin packing with conflicts
• An on-line algorithm for variable-sized bin packing
• Online packing of arbitrary sized items into designated and multipurpose bins
• A new version of on-line variable-sized bin packing
• Approximation and Online Algorithms
• scientific article; zbMATH DE number 5761817
• scientific article; zbMATH DE number 1134660
• On-line bin packing with two item sizes
• scientific article; zbMATH DE number 1756012
• On the online bin packing problem

Cites work

• scientific article; zbMATH DE number 3890754 (Why is no real title available?)
• A Study of Composite Heuristic Algorithms
• A lower bound for on-line bin packing
• A simple on-line bin-packing algorithm
• A storage-size selection problem
• An Efficient Approximation Scheme for Variable-Sized Bin Packing
• Fast algorithms for bin packing
• New Algorithms for Bin Packing
• On-line bin packing in linear time
• Variable Sized Bin Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(32)

• The variable-width strip packing problem
• A new version of on-line variable-sized bin packing
• scientific article; zbMATH DE number 2090002 (Why is no real title available?)
• Online bin packing with \((1,1)\) and \((2,R)\) bins
• Approximation and Online Algorithms
• Online Bin Packing with (1,1) and (2,R) Bins
• Online bin packing with delay and holding costs
• An on-line algorithm for variable-sized bin packing
• scientific article; zbMATH DE number 1810252 (Why is no real title available?)
• Online bin packing with overload cost
• Variable Sized Bin Packing
• The maximum resource bin packing problem
• Fundamentals of Computation Theory
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
• Sparse, continuous policy representations for uniform online bin packing via regression of interpolants
• scientific article; zbMATH DE number 910900 (Why is no real title available?)
• A bin packing problem with over-sized items
• A new variable-sized bin packing problem
• An iterated greedy algorithm for the planning of yarn‐dyeing boilers
• Online rules for container stacking
• Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms
• Bin‐packing problem with concave costs of bin utilization
• Online packing of arbitrary sized items into designated and multipurpose bins
• A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing
• scientific article; zbMATH DE number 5761817 (Why is no real title available?)
• A storage-size selection problem
• Worst-case analysis of the FFH algorithm for online variable-sized bin packing
• New Bounds for Variable-Sized Online Bin Packing
• scientific article; zbMATH DE number 1264403 (Why is no real title available?)
• On-line bin packing ? A restricted survey
• scientific article; zbMATH DE number 2086631 (Why is no real title available?)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers

This page was built for publication: Online variable-sized bin packing

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