A stochastic model of bin-packing
From MaRDI portal
Cited in
(21)- Convergence of optimal stochastic bin packing
- The average-case analysis of some on-line algorithms for bin packing
- Average-case analysis of the smart next fit algorithm
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
- A class of simple stochastic online bin packing algorithms
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
- Average performance of greedy heuristics for the integer knapsack problem.
- Deep performance analysis of refined harmonic bin packing algorithm
- Evaluating the quality of online optimization algorithms by discrete event simulation
- Average-case performance analysis of a 2D strip packing algorithm -- NFDH
- Average-case analysis of the modified harmonic algorithm
- An introduction to stochastic bin packing-based server consolidation with conflicts
- Average case analysis of bounded space bin packing algorithms
- A concentration inequality for the facility location problem
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Randomized algorithms for the on-line minimum matching problem on euclidean space
- Adaptive Bin Packing with Overflow
- Near-optimal algorithms for stochastic online bin packing
- Lower bounds for several standard bin packing algorithms in the random order model
- Probabilistic behaviour of optimal bin-packing solutions
- Random-order bin packing
This page was built for publication: A stochastic model of bin-packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893332)
