一个基于三元结构的在线装箱问题
An online bin-packing problem with an underlying ternary structure
摘要:
根据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分析而来,可能存在错误,请以论文正文为准。