An online bin-packing problem with an underlying ternary structure

IF 0.6 3区数学 Q3 MATHEMATICS

Ars Mathematica Contemporanea Pub Date : 2021-09-07 DOI:10.26493/1855-3974.2701.b7d

H. Prodinger

引用次数: 0

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.

查看原文本刊更多论文

具有底层三元结构的在线装箱问题

根据Kn模型的原始思想，考虑了大件货物双包到达的在线装箱问题。同时也考虑了小物品以双包形式送达的双重问题。枚举具有三元随机游走的特点，枚举采用核方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Ars Mathematica Contemporanea MATHEMATICS, APPLIED-MATHEMATICS

CiteScore

1.70

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Ars mathematica contemporanea will publish high-quality articles in contemporary mathematics that arise from the discrete and concrete mathematics paradigm. It will favor themes that combine at least two different fields of mathematics. In particular, we welcome papers intersecting discrete mathematics with other branches of mathematics, such as algebra, geometry, topology, theoretical computer science, and combinatorics. The name of the journal was chosen carefully. Symmetry is certainly a theme that is quite welcome to the journal, as it is through symmetry that mathematics comes closest to art.