… In this work, we focus on the online variant of bin packing, in which the set of items is not
known in advance but is rather revealed in the form of a sequence. Upon the arrival of a new …

… when the predictions are adversarially bad. We develop a new online algorithm with a …
log(𝜖2𝜇)),𝑂(𝜇)} (where 𝜖 is the maximum multiplicative error of prediction among all items), …

… algorithms with good average-case performance based on the Sum of Squares algorithm
for Online Discrete Bin Packing [14, 13]. In this paper, we consider a more general setting only …

… The online bin packing problem is a well-known optimization challenge that finds application
… fuzzy inference and pattern-based predictions of the distribution of item sizes in online bin …

… We formulate this online 3D-BPP as a constrained Markov … a prediction-and-projection
scheme: The agent first predicts a … lookahead items, multi-bin packing, and item re-orienting. We …

… Furthermore, this work shows a lower bound on the robustness of any online classical bin
packing algorithm for any consistency better than 1.3; similarly, we establish a lower bound for …

… The online bin packing problem is a well-known bin packing … one at a time into fixed capacity
bins without any overflow. The … while FDC values close to 0 the prediction is indeterminate. …

… bin packing with predictions. Angelopoulos et al. [3] studied online bin packing with predictions
… Online bin packing is different from dynamic bin packing in that items never depart after …

… /Published online 27 December 2021 Abstract We tackle the online 3D bin packing problem
(… We also feed the last predicted action to the next actor-head as a conditional probabilistic …

… when the predictions are adversarially bad. We develop a new online algorithm with a …
} (where 𝜖 is the maximum multiplicative error of prediction among all items), achieving 𝑂(√…