Online bin packing with cardinality constraints resolved
From MaRDI portal
Publication:2186811
DOI10.1016/j.jcss.2020.03.002zbMath1442.68269arXiv1608.06415OpenAlexW2963196750MaRDI QIDQ2186811
Leah Epstein, Asaf Levin, János Balogh, József Békési, György Dósa
Publication date: 9 June 2020
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.06415
Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)
Related Items (7)
Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ Lower bounds on the performance of online algorithms for relaxed packing problems ⋮ EPTAS for the dual of splittable bin packing with cardinality constraint ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ A new lower bound for classic online bin packing ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Several methods of analysis for cardinality constrained bin packing
Cites Work
- Unnamed Item
- New lower bounds for certain classes of bin packing algorithms
- An improved lower bound for on-line bin packing algorithms
- Resource constrained scheduling as generalized bin packing
- Fast algorithms for bin packing
- Algorithms for on-line bin-packing problems with cardinality constraints
- Cardinality constrained bin-packing problems
- Improved lower bounds for the online bin packing problem with cardinality constraints
- Bounds for online bin packing with cardinality constraints
- AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- New Algorithms for Bin Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- Approximation schemes for ordered vector packing problems
- Packing Small Vectors
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Online Lower Bounds via Duality
- Beating the Harmonic Lower Bound for Online Bin Packing
- On-line bin packing in linear time
- Online Bin Packing with Cardinality Constraints
- Tight bounds for online vector bin packing
This page was built for publication: Online bin packing with cardinality constraints resolved
