Online variable-sized bin packing
From MaRDI portal
Publication:1111472
DOI10.1016/0166-218X(88)90089-3zbMath0657.90080OpenAlexW2019755210MaRDI QIDQ1111472
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
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)
Related Items (13)
Online bin packing with overload cost ⋮ Worst-case analysis of the FFH algorithm for online variable-sized bin packing ⋮ On-line bin packing ? A restricted survey ⋮ An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ A new version of on-line variable-sized bin packing ⋮ Online packing of arbitrary sized items into designated and multipurpose bins ⋮ An on-line algorithm for variable-sized bin packing ⋮ A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing ⋮ The variable-width strip packing problem ⋮ Online Bin Packing with (1,1) and (2,R) Bins ⋮ Online bin packing with \((1,1)\) and \((2,R)\) bins
Cites Work
- Unnamed Item
- A storage-size selection problem
- A lower bound for on-line bin packing
- Fast algorithms for bin packing
- Variable Sized Bin Packing
- A Study of Composite Heuristic Algorithms
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- A simple on-line bin-packing algorithm
- New Algorithms for Bin Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- On-line bin packing in linear time
This page was built for publication: Online variable-sized bin packing
