Online variable-sized bin packing
From MaRDI portal
Publication:1111472
DOI10.1016/0166-218X(88)90089-3zbMATH Open0657.90080OpenAlexW2019755210MaRDI QIDQ1111472FDOQ1111472
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
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
- 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
Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Cites Work
- A simple on-line bin-packing algorithm
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- A lower bound for on-line bin packing
- Fast algorithms for bin packing
- Title not available (Why is that?)
- New Algorithms for Bin Packing
- On-line bin packing in linear time
- Variable Sized Bin Packing
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- A storage-size selection problem
- A Study of Composite Heuristic Algorithms
Cited In (32)
- Sparse, continuous policy representations for uniform online bin packing via regression of interpolants
- Title not available (Why is that?)
- Online bin packing with overload cost
- New Bounds for Variable-Sized Online Bin Packing
- A bin packing problem with over-sized items
- Fundamentals of Computation Theory
- Title not available (Why is that?)
- Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms
- A new version of on-line variable-sized bin packing
- Variable Sized Bin Packing
- Online bin packing with \((1,1)\) and \((2,R)\) bins
- An on-line algorithm for variable-sized bin packing
- Worst-case analysis of the FFH algorithm for online variable-sized bin packing
- A storage-size selection problem
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers
- A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing
- The variable-width strip packing problem
- On-line bin packing ? A restricted survey
- Online packing of arbitrary sized items into designated and multipurpose bins
- Title not available (Why is that?)
- Approximation and Online Algorithms
- Title not available (Why is that?)
- Online rules for container stacking
- Bin‐packing problem with concave costs of bin utilization
- Online bin packing with delay and holding costs
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Online Bin Packing with (1,1) and (2,R) Bins
- Title not available (Why is that?)
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- Title not available (Why is that?)
- The maximum resource bin packing problem
- A new variable-sized bin packing problem
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)
