The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Approximation algorithms for combinatorial problems
Johnson, D. S. (1974) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(74)80044-9 · Cited by 2,197
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
Using dual approximation algorithms for scheduling problems theoretical and practical results
Hochbaum, D. S., & Shmoys, D. B. (1987) · Journal of the ACM · doi:10.1145/7531.7535 · Cited by 790
Approximation 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
Lower bounds and reduction procedures for the bin packing problem
Martello, S., & Toth, P. (1990) · Discrete Applied Mathematics · doi:10.1016/0166-218x(90)90094-s · Cited by 291
Simple assembly line balancing?Heuristic approaches
Schöll, A., & Voß, S. (1997) · Journal of Heuristics · doi:10.1007/bf00127358 · Cited by 218
New worst-case results for the bin-packing problem
Simchi‐Levi, D. (1994) · Naval Research Logistics (NRL) · doi:10.1002/1520-6750(199406)41:4<579::aid-nav3220410409>3.0.co;2-g · Cited by 209
Cited by
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
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
Multiblock ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers
Gambella, C., & Simonetto, A. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3033139 · Cited by 60
Weibull-Based Benchmarks for Bin Packing
Castiñeiras, I., De Cauwer, M., & O’Sullivan, B. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33558-7_17 · Cited by 14
A hybrid approach for optimizing carbon footprint in intercloud environment
Justafort, V. D., Beaubrun, R., & Pierre, S. (2019) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2016.2638900 · Cited by 7
Metadata
- Authors
- Scholl, A., Klein, R., & Jürgens, C.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 1997-07
- Volume
- 24
- Issue
- 7
- Pages
- 627-645
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W1911626819
- Cited by
- 295
- References
- 16
- FWCI
- 21.65
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. https://app.cochat.ai/papers/10.1016/s0305-0548(96)00082-2
- The paper
- Scholl, A., Klein, R., & Jürgens, C. (1997). Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research. https://doi.org/10.1016/s0305-0548(96)00082-2
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.