The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Abstract
The following abstract problem models several practical problems in computer science and operations research: given a list L of real numbers between 0 and l, place the elements of L into a minimum number $L^ * $ of “bins” so that no bin contains numbers whose sum exceeds l. Motivated by the likelihood that an excessive amount of computation will be required by any algorithm which actually determines an optimal placement, we examine the performance of a number of simple algorithms which obtain “good” placements. The first-fit algorithm places each number, in succession, into the first bin in which it fits. The best-fit algorithm places each number, in succession, into the most nearly full bin in which it fits. We show that neither the first-fit nor the best-fit algorithm will ever use more than $\frac{17}{10}L^ * + 2$ bins. Furthermore, we outline a proof that, if L is in decreasing order, then neither algorithm will use more than $\frac{11}{9} L^ * + 4$ bins. Examples are given to show that both upper bounds are essentially the best possible. Similar results are obtained when the list L contains no numbers larger than $\alpha < 1$.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
A Linear Programming Approach to the Cutting Stock Problem—Part II
Gilmore, P. C., & Gomory, R. E. (1963) · Operations Research · doi:10.1287/opre.11.6.863 · Cited by 1,119
Fast algorithms for bin packing
Johnson, D. S. (1974) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(74)80026-7 · Cited by 540
Self-citation
Cited by
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70356-x · Cited by 5,854
Self-citationWorst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
Christofides, N. (2022) · Operations Research Forum · doi:10.1007/s43069-021-00101-z · Cited by 1,131
The NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
Self-citationApproximation Algorithms for Bin-Packing — An Updated Survey
Coffman, E. G., Garey, M. R., & Johnson, D. S. (1984) · CISM International Centre for Mechanical Sciences · doi:10.1007/978-3-7091-4338-4_3 · Cited by 433
Self-citationA simple on-line bin-packing algorithm
Lee, C. C., & Lee, D. T. (1985) · Journal of the ACM · doi:10.1145/3828.3833 · Cited by 357
Consolidating virtual machines with dynamic bandwidth demand in data centers
Wang, M., Meng, X., & Zhang, L. (2011) · 2011 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2011.5935254 · Cited by 339
On the online bin packing problem
Seiden, S. S. (2002) · Journal of the ACM · doi:10.1145/585265.585269 · Cited by 310
Exploring Hyper-heuristic Methodologies with Genetic Programming
Burke, E. K., Hyde, M. R., Kendall, G., Ochoa, G., Ozcan, E., & Woodward, J. R. (2009) · Intelligent Systems Reference Library · doi:10.1007/978-3-642-01799-5_6 · Cited by 304
Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
Scholl, A., Klein, R., & Jürgens, C. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(96)00082-2 · Cited by 295
Bin Packing Approximation Algorithms: Survey and Classification
Coffman, E. G., Csirik, J., Galambos, G., Martello, S., & Vigo, D. (2013) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4419-7997-1_35 · Cited by 289
Evolving Bin Packing Heuristics with Genetic Programming
Burke, E. K., Hyde, M. R., & Kendall, G. (2006) · Lecture Notes in Computer Science · doi:10.1007/11844297_87 · Cited by 144
On-line bin packing in linear time
Ramanan, P., Brown, D. J., Lee, C. C., & Lee, D. T. (1989) · Journal of Algorithms · doi:10.1016/0196-6774(89)90031-x · Cited by 127
Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. (2007) · Proceedings of the 9th annual conference on Genetic and evolutionary computation · doi:10.1145/1276958.1277273 · Cited by 121
The scalability of evolved on line bin packing heuristics
Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. R. (2007) · 2007 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2007.4424789 · Cited by 55
The optimal absolute ratio for online bin packing
Balogh, J., Békési, J., Dósa, G., Sgall, J., & Stee, R. V. (2015) · Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms · doi:10.1137/1.9781611973730.94 · Cited by 17
Providing a memory mechanism to enhance the evolutionary design of heuristics
Burke, E. K., Hyde, M. R., & Kendall, G. (2010) · IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2010.5586388 · Cited by 15
Bag All You Need: Learning a Generalizable Bagging Strategy for Heterogeneous Objects
Bahety, A., Jain, S., Ha, H., Hager, N., Burchfiel, B., Cousineau, E., Feng, S., & Song, S. (2023) · 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros55552.2023.10341841 · Cited by 15
Metadata
- Authors
- Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., & Graham, R. L.
- Venue
- SIAM Journal on Computing
- Published
- 1974-12
- Volume
- 3
- Issue
- 4
- Pages
- 299-325
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2043862089
- Cited by
- 911
- References
- 4
- FWCI
- 57.23
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.