Open-end bin packing: new and old analysis approaches

05/12/2021
by   Leah Epstein, et al.
0

We analyze a recently introduced concept, called the price of clustering, for variants of bin packing called open-end bin packing problems (OEBP). Input items have sizes, and they also belong to a certain number of types. The new concept deals with the comparison of optimal solutions for the cases where items of distinct types can and cannot be packed together, respectively. The problem is related to greedy bin packing algorithms and to batched bin packing, and we discuss some of those concepts as well. We analyze max-OEBP, where a packed bin is valid if by excluding its largest item, the total size of items is below 1. For this variant, we study the case of general item sizes, and the parametric case with bounded item sizes, which shows the effect of small items. Finally, we briefly discuss min-OEBP, where a bin is valid if the total size of its items excluding the smallest item is below 1, which is known to be an entirely different problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/19/2021

Several methods of analysis for cardinality constrained bin packing

We consider a known variant of bin packing called cardinality constraine...
research
08/19/2019

On bin packing with clustering and bin packing with delays

We continue the study of two recently introduced bin packing type proble...
research
07/16/2020

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time

Knapsack problems are among the most fundamental problems in optimizatio...
research
05/09/2019

Variable Neighborhood Search for the Bin Packing Problem with Compatible Categories

Bin Packing with Conflicts (BPC) are problems in which items with compat...
research
07/22/2020

Online Adaptive Bin Packing with Overflow

Motivated by bursty bandwidth allocation and by the allocation of virtua...
research
02/20/2018

Selection from heaps, row-sorted matrices and X+Y using soft heaps

We use soft heaps to obtain simpler optimal algorithms for selecting the...
research
03/01/2023

Hybrid Approach for Solving Real-World Bin Packing Problem Instances Using Quantum Annealers

Efficient packing of items into bins is a common daily task. Known as Bi...

Please sign up or login with your details

Forgot password? Click here to reset