The DOI matches its Crossref record; 181 of the 181 references it cites were found in a registry or an index.
Bin Packing Approximation Algorithms: Survey and Classification
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
(1979) · Cited by 43,841
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Approximation Algorithms for NP-Hard Problems
(1997) · ACM SIGACT News · doi:10.1145/261342.571216 · Cited by 3,103
Bounds on Multiprocessing Timing Anomalies
Graham, R. L. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117039 · Cited by 2,443
Handbooks in operations research and management science
Nemhauser, G. L., & Kan, A. H. G. R. (1989) · Elsevier eBooks · Cited by 2,436
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
Integer Programming with a Fixed Number of Variables
Lenstra, H. W. (1983) · Mathematics of Operations Research · doi:10.1287/moor.8.4.538 · Cited by 1,440
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
Research works printed but not linked: 11
- S. Albers, Better bounds for on-line scheduling, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 130–139 $$\bullet \ \ mincap\vert \mathit{on - line}\vert R_{A}\mathit{bound}.$$
- J. Csirik, B. Imreh, On the worst-case performance of the Next-k-Fit bin-packing heuristic. Acta Cybern. 9, 89–105 (1989) $$\bullet \ \ pack\vert \mathit{bounded - space}\vert R_{A}^{\infty }\mathit{bounds}.$$
- J. Csirik, V. Totik, On-line algorithms for a dual version of bin packing. Discret. Appl. Math. 21, 163–167 (1988) $$\bullet \ \ cover\vert \mathit{on - line}\vert R_{A}^{\infty }\mathit{bound}.$$
- J. Csirik, G. Galambos, G. Turan, Some results on bin-packing, in Proceedings of the EURO VI Conference, Vienna, Austria, 1983, pp. 52 $$\bullet \ \ pack\vert \mathit{on - line},\mathit{off - line}\vert R_{A}^{\infty }.$$
- G. Gambosi, A. Postiglione, M. Talamo, New algorithms for on-line bin packing, in Algorithms and Complexity, ed. by R. Petreschi, G. Ausiello, D.P. Bovet (World Scientific, Singapore, 1990), pp. 44–59. This is the preliminary version of [99]
- L.A. Hall, Approximation algorithms for scheduling, in Approximation Algorithms for NP-Hard Problems, ed. by D.S. Hochbaum (PWS Publishing Company, Boston, 1997), pp. 1–45
- D.S. Hochbaum (ed.), Approximation Algorithms for NP-Hard Problems (PWS Publishing Company, Boston, 1997)
- D.S. Hochbaum, Various notions of approximation: good, better, best, and more, in Approximation Algorithms for NP-Hard Problems, ed. by D.S. Hochbaum (PWS Publishing Company, Boston, 1997), pp. 389–391
- K.A. Kierstead, W.T. Trotter, An extremal problem in recursive combinatorics. Congr. Numer. 33, 143–153 (1981)
- A. van Vliet, Lower and Upper Bounds for On-Line Bin Packing and Scheduling Heuristic. PhD thesis, Erasmus University, Rotterdam, 1995
- K. Xu, A Bin-Packing Problem with Item Sizes in the Interval $$(0,\alpha ]$$ for $$\alpha \leq \frac{1} {2}.$$ PhD thesis, Chinese Academy of Sciences, Institute of Applied Mathematics, Beijing, China, 1993
Cited by
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
Bin packing and cutting stock problems: Mathematical models and exact algorithms
Delorme, M., Iori, M., & Martello, S. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.04.030 · Cited by 379
Self-citationThe 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
Metadata
- Authors
- Coffman, E. G., Csirik, J., Galambos, G., Martello, S., & Vigo, D.
- Affiliations
- Columbia University (US)
- University of Szeged (HU)
- Venue
- Handbook of Combinatorial Optimization
- Publisher
- Springer New York
- Published
- 2013
- Pages
- 455-531
- OpenAlex
- W90213227
- Cited by
- 289
- References
- 181
- Citations by year
- 2026: 9 · 2025: 14 · 2024: 21 · 2023: 29 · 2022: 17 · 2021: 24 · 2020: 35 · 2019: 32 · 2018: 27 · 2017: 28 · 2016: 15 · 2015: 20 · 2014: 17 · 2013: 1
- FWCI
- 72.62
- Type
- book chapter
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Springer eBooks (publishedVersion)
- VU Research Portal (publishedVersion)
- Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna) (submittedVersion)
- Data Archiving and Networked Services (DANS) (submittedVersion)
- 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 › Mathematics › Theoretical Computer Science › Optimization and Search Problems
- Keywords
- bin packing, approximation algorithms, performance guarantees, online algorithms, offline algorithms, algorithm classification
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: Bin Packing Approximation Algorithms: Survey and Classification. https://app.cochat.ai/papers/10.1007/978-1-4419-7997-1_35
- The paper
- Coffman, E. G., Csirik, J., Galambos, G., Martello, S., & Vigo, D. (2013). Bin Packing Approximation Algorithms: Survey and Classification. Handbook of Combinatorial Optimization. https://doi.org/10.1007/978-1-4419-7997-1_35
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.