arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.03117math.CO
收藏

一个基于三元结构的在线装箱问题

An online bin-packing problem with an underlying ternary structure

Helmut Prodinger

摘要:

根据Knödel的原始想法,考虑了大型物品以双层包装到达的在线装箱问题。也被认为是双重问题的小项目到达双包。枚举具有三元随机游动的味道,并为枚举,核方法。

英文摘要:

Following an orginal idea by Knödel, 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑