The DOI matches its Crossref record; 89 of the 92 references it cites were found in a registry or an index.
Approximation Algorithms for Bin-Packing — An Updated Survey
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“However, they often show poor performance in practice39.”
From Mathematical discoveries from program search with large language models (2024) · cites this paper as [39]
Citations
Cites
(1979) · Cited by 43,841
Self-citationReducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
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
Complexity of Computer Computations
(1972) · Springer eBooks · doi:10.1007/978-1-4684-2001-2 · Cited by 2,781
Bounds on Multiprocessing Timing Anomalies
Graham, R. L. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117039 · Cited by 2,443
A Linear Programming Approach to the Cutting-Stock Problem
Gilmore, P. C., & Gomory, R. E. (1961) · Operations Research · doi:10.1287/opre.9.6.849 · Cited by 2,024
Bounds for Certain Multiprocessing Anomalies
Graham, R. L. (1966) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1966.tb01709.x · Cited by 1,647
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
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., & Graham, R. L. (1974) · SIAM Journal on Computing · doi:10.1137/0203025 · Cited by 911
Self-citationMultistage Cutting Stock Problems of Two and More Dimensions
Gilmore, P. C., & Gomory, R. E. (1965) · Operations Research · doi:10.1287/opre.13.1.94 · Cited by 809
Research works printed but not linked: 12
- Assmann, S. B., Doctoral Dissertation, Department of Mathematics, M.I.T., Cambridge, Mass. (1983).
- Biro, M. and Boros, E., “A network flow approach to non-guillotine cutting problems,” Working Paper MO/30 (1982), Computer and Automation Institute, Hungarian Academy of Sciences, Budapest.
- Brown, A. R., Optimum Packing and Depletion, American Elsevier, New York (1971).
- Garey, M. R., Graham, R. L., and Johnson, D. S., “On a number-theoretic bin packing conjecture,” Proc. 5th Hungarian Combinatorics Colloquium, North-Holland, Amsterdam (1978), 377–392.
- Golan, I., “Two orthogonal oriented algorithms for packing in two dimension,” Report 1979/311/MHM, Computer Center M.O.D., P. O. Box 2250, Haifa, Israel (1979).
- Graham, R. L., “Bounds on performnce of scheduling algorithms,” in E. G. Coffman, Jr. (ed.), Computer and Job-Shop Scheduling Theory, John Wiley & Sons, New York (1976), 165–227.
- Hofri, M., “Bin-packing: An analysis of the Next-Fit algorithm,” Tech. Rep. No. 242, Dept. of Computer Science, The Technion, Haifa, Israel (1982).
- Knuth, D. E., Fundamental Algorithms, Vol. 1, Second edition, Addison-Wesley (1973).
- Langston, M. A., Processor Scheduling with Improved Heuristic Algorithms, Doctoral dissertation, Texas A&M University, College Station, Texas (1981).
- Langston, M. A., “Improved LPT scheduling for identical processor systems,” RAIRO-Technique et Science Informatiques, 1 (1982), 69–75.
- Loulou, R., “Probabilistic behavior of optimal bin packing solutions,” Tech. Rep., Faculty of Management, McGill University, Montreal (1982).
- Schrijver, A. (ed.), Packing and Covering in Combinatorics, published by Mathematical Centre, Tweede Boerhaavestraat 49, Amsterdam (1979).
Cited by
A typology of cutting and packing problems
Dyckhoff, H. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90350-k · Cited by 1,125
Search-based software engineering: Trends, techniques and applications
Harman, M., Mansouri, S. A., & Zhang, Y. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379787 · Cited by 777
“The allocation of teams to work packages in software project planing can be thought of as an application of a bin packing problem [Coffman et al. 1984].”
Mathematical discoveries from program search with large language models
Romera-Paredes, B., Barekatain, M., Novikov, A., Balog, M., Kumar, M. P., Dupont, E., Ruiz, F. J. R., Ellenberg, J. S., Wang, P., Fawzi, O., et al. (2024) · Nature · doi:10.1038/s41586-023-06924-6 · Cited by 544
An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
Hopper, E. M., & Turton, B. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(99)00357-4 · Cited by 516
On genetic algorithms for the packing of polygons
Jakobs, S. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(94)00166-9 · Cited by 494
Metadata
- Authors
- Coffman, E. G., Garey, M. R., & Johnson, D. S.
- Venue
- CISM International Centre for Mechanical Sciences
- Publisher
- Springer Vienna
- Published
- 1984
- Pages
- 49-106
- ISSN
- 0254-1971 (ISSN-L)
- 2309-3706
- OpenAlex
- W1519941054
- Cited by
- 433
- References
- 92
- Citations by year
- 2026: 4 · 2025: 8 · 2024: 11 · 2023: 5 · 2022: 7 · 2021: 14 · 2020: 8 · 2019: 14 · 2018: 9 · 2017: 7 · 2016: 7 · 2015: 8 · 2014: 8 · 2013: 7 · 2012: 3
- FWCI
- 61.09
- Type
- book chapter
- Language
- en
- Open access
- closed
- Locations
- Courses and lectures (publishedVersion)
- Topics
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Optimization and Packing Problems
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
- Keywords
- bin packing, approximation algorithms, approximation ratio, scheduling, combinatorial optimization
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Approximation Algorithms for Bin-Packing — An Updated Survey. https://app.cochat.ai/papers/10.1007/978-3-7091-4338-4_3
- The paper
- Coffman, E. G., Garey, M. R., & Johnson, D. S. (1984). Approximation Algorithms for Bin-Packing — An Updated Survey. CISM International Centre for Mechanical Sciences. https://doi.org/10.1007/978-3-7091-4338-4_3
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.