A stochastic model of bin-packing
From MaRDI portal
Publication:3893332
DOI10.1016/S0019-9958(80)90050-9zbMath0447.68078MaRDI QIDQ3893332
No author found.
Publication date: 1980
Published in: Information and Control (Search for Journal in Brave)
Combinatorial aspects of packing and covering (05B40) Discrete mathematics in relation to computer science (68R99)
Related Items
Deep performance analysis of refined harmonic bin packing algorithm, An introduction to stochastic bin packing-based server consolidation with conflicts, Evaluating the quality of online optimization algorithms by discrete event simulation, The average-case analysis of some on-line algorithms for bin packing, Average-case analysis of the smart next fit algorithm, A concentration inequality for the facility location problem, Probabilistic analysis for simple one- and two-dimensional bin packing algorithms, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, A class of simple stochastic online bin packing algorithms, Randomized algorithms for the on-line minimum matching problem on euclidean space, Average performance of greedy heuristics for the integer knapsack problem., Random-order bin packing, Average case analysis of bounded space bin packing algorithms, Packings in two dimensions: Asymptotic average-case analysis of algorithms, Average-case performance analysis of a 2D strip packing algorithm -- NFDH, Average-case analysis of the modified harmonic algorithm, Probabilistic behaviour of optimal bin-packing solutions, Convergence of optimal stochastic bin packing, Adaptive Bin Packing with Overflow
