Some comments on a bin-packing problem of W. Knödel.

DOI10.1007/BF02320195MaRDI QIDQ1184693zbMATH OpenFDO

Authors Helmut Prodinger

Publication date 28 June 1992

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02320195

zbMATH Keywords

bin-packinggenerating functionsMellin transformsrandom walks

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Recommendations

• scientific article; zbMATH DE number 3888927
• Bin packing as a random walk: A note on Knödel's paper
• Publication:3489458
• Probabilistic behaviour of optimal bin-packing solutions
• Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings

Cites work

• scientific article; zbMATH DE number 3888927 (Why is no real title available?)
• scientific article; zbMATH DE number 1142298 (Why is no real title available?)
• scientific article; zbMATH DE number 3995711 (Why is no real title available?)
• scientific article; zbMATH DE number 3273551 (Why is no real title available?)
• Singularity Analysis of Generating Functions

Cited in

(2)

• Comments on the hierarchically structured bin packing problem
• An online bin-packing problem with an underlying ternary structure

This page was built for publication: Some comments on a bin-packing problem of W. Knödel.

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