A stochastic analysis of the NFD bin-packing algorithm
Journal of Algorithms
Probabilistic analysis of algorithms: on computing methodologies for computer algorithms performance evaluation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A probabilistic analysis of the next fit decreasing bin packing heuristic
Operations Research Letters
Probabilistic analysis of the next fit decreasing algorithm for bin-packing
Operations Research Letters
A note on a selfish bin packing problem
Journal of Global Optimization
Hi-index | 0.00 |
Suppose the next-fit algorithm packs {x"1, x"2, ..., x"n} into k identical bins. Under modest assumptions about what fits into a bin, we prove that next-fit also packs {x"n, ..., x"2, x"1} into k bins. Thus, the next-fit decreasing algorithm uses the same number of bins as a next-fit increasing algorithm.