Bin packing as a random walk: A note on Knödel's paper

DOI10.1016/0167-6377(86)90090-8zbMath0605.90100OpenAlexW2091339311MaRDI QIDQ1084021

János A. Csirik

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90090-8

zbMATH Keywords

probabilistic analysisrandom walkbin packingasymptotic expected behaviorspecial stochastic input sequences

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (1)

An O(n) bin-packing algorithm for uniformly distributed data

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
• Bin packing can be solved within 1+epsilon in linear time
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

This page was built for publication: Bin packing as a random walk: A note on Knödel's paper