A note on a variant of the online open end bin packing problem
From MaRDI portal
Publication:2661578
DOI10.1016/j.orl.2020.10.006OpenAlexW3096952082MaRDI QIDQ2661578
Publication date: 7 April 2021
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2020.10.006
Related Items (4)
On various open-end bin packing game ⋮ Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ Open-end bin packing: new and old analysis approaches ⋮ More on ordered open end bin packing
Cites Work
- New lower bounds for certain classes of bin packing algorithms
- An improved approximation scheme for variable-sized bin packing
- Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
- Hardness of lazy packing and covering
- On lazy bin covering and packing problems
- Bin packing can be solved within 1+epsilon in linear time
- Parameterized on-line open-end bin packing
- A faster FPTAS for the unbounded knapsack problem
- Fully dynamic bin packing revisited
- A lower bound for online rectangle packing
- Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
- Bounds for online bin packing with cardinality constraints
- Integer Programming with a Fixed Number of Variables
- The Ordered Open-End Bin-Packing Problem
- A simple on-line bin-packing algorithm
- On-line bin packing in linear time
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
- On Integer Programming and Convolution.
- Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
- Lower bounds for several online variants of bin packing
- A new lower bound for classic online bin packing
- A note on an open-end bin packing problem
This page was built for publication: A note on a variant of the online open end bin packing problem
