On-line bin packing in linear time
References (15)
Fast algorithms for bin packing
J. Comput. System Sci.
(1974)A lower bound for on-line bin packing
Inform. Process. Lett.
(1980)- et al.
Shelf algorithms for two-dimensional packing problems
SIAM J. Comput.
(1983) A Lower Bound for On-line One-dimensional Bin Packing Algorithms
- D. J. Brown, draft,...
- et al.
Approximation algorithms for bin packing—An updated survey
- et al.
Computers and Intractability: A Guide to the Theory of NP-Completeness
(1979)
There are more references available in the full text version of this article.
Cited by (114)
A pattern-based algorithm with fuzzy logic bin selector for online bin packing problem
2024, Expert Systems with ApplicationsTighter bounds for the harmonic bin packing algorithm
2024, European Journal of Operational ResearchSeveral methods of analysis for cardinality constrained bin packing
2023, Theoretical Computer ScienceOpen-end bin packing: New and old analysis approaches
2022, Discrete Applied MathematicsA note on a variant of the online open end bin packing problem
2020, Operations Research LettersCitation Excerpt :If there are several types of outputs, it is possible to use a different weight function for each one of them [17,23]. We use the standard analysis using weight functions [15,17,23] to conclude the following result. Thus, we conclude the following observation.
Online bin packing with cardinality constraints resolved
2020, Journal of Computer and System Sciences
- ∗
Part of this author's work was performed when he was a graduate student at the University of Illinois, Urbana, IL. His work was supported in part by an IBM Graduate Fellowship.
- †
This author's work was supported by the National Science Foundation under Grant NSF IST 80-12240 and the Joint Services Electronics Program (U.S. Army, U.S. Navy, and U.S. Air Force) under Contract N00014-79-C-0424.
Copyright © 1989 Published by Elsevier Inc.