An online bin-packing problem with an underlying ternary structure

DOI10.26493/1855-3974.2701.B7DMaRDI QIDQ6597990zbMATH OpenFDO

Authors Helmut Prodinger

Publication date 4 September 2024

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.26493/1855-3974.2701.B7D

zbMATH Keywords

coefficient extractionkernel methodKnödel walksstate diagramthird-order recursion

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05)

Recommendations

• Online algorithms for a dual version of bin packing
• Some comments on a bin-packing problem of W. Knödel.
• On-Line Bin Packing of Items of Random Sizes, II
• Publication:3489458
• scientific article; zbMATH DE number 3888927

Cites work

• Enumeration of S-Motzkin paths from left to right and from right to left: a kernel method approach
• scientific article; zbMATH DE number 2046058 (Why is no real title available?)
• scientific article; zbMATH DE number 1391729 (Why is no real title available?)
• On Two Subclasses of Motzkin Paths and Their Relation to Ternary Trees
• The kernel method: a collection of examples

This page was built for publication: An online bin-packing problem with an underlying ternary structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6597990)