An online bin-packing problem with an underlying ternary structure
Combinatorics
2021-09-08 v1
Abstract
Following an orginal idea by Kn\"odel, an online bin-packing problem is considered where the the large items arrive in double-packs. The dual problem where the small items arrive in double-packs is also considered. The enumerations have a ternary random walk flavour, and for the enumeration, the kernel method is employed.
Cite
@article{arxiv.2109.03117,
title = {An online bin-packing problem with an underlying ternary structure},
author = {Helmut Prodinger},
journal= {arXiv preprint arXiv:2109.03117},
year = {2021}
}