Packing items from a triangular distribution
From MaRDI portal
Publication:1107981
DOI10.1016/0020-0190(87)90212-2zbMath0653.68013OpenAlexW2059411860MaRDI QIDQ1107981
Dennis James Volper, Kadri Krause, Lawrence L. Larmore
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/89f2r71f
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Algorithms in computer science (68W99)
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic behaviour of optimal bin-packing solutions
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
- Some distributions that allow perfect packing
- Optimal Bin Packing with Items of Random Sizes
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: Packing items from a triangular distribution