Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem

Publisher Website

1 September 1987

journal article
Published by Springer Nature in Computing

Vol. 39 (3) , 201-217
https://doi.org/10.1007/bf02309555

Abstract

No abstract available

Keywords

All Related Versions

Version 1, RePEc (Unconfirmed version)

This publication has 8 references indexed in Scilit:

Fast algorithms for bin packing
Published by Elsevier ,2007
A probabilistic analysis of the next fit decreasing bin packing heuristic
Operations Research Letters, 1986
Probabilistic Analysis of Bin Packing Heuristics
Operations Research, 1984
On Packing Two-Dimensional Bins
SIAM Journal on Algebraic Discrete Methods, 1982
A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
SIAM Journal on Algebraic Discrete Methods, 1981
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
SIAM Journal on Computing, 1980
A lower bound for on-line bin packing
Information Processing Letters, 1980
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
SIAM Journal on Computing, 1974